Author of the publication

The b-Matching Problem in Hypergraphs: Hardness and Approximability.

, and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 200-211. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Inapproximability of b-Matching in k-Uniform Hypergraphs., , and . WALCOM, volume 6552 of Lecture Notes in Computer Science, page 57-69. Springer, (2011)An approximation algorithm for the partial vertex cover problem in hypergraphs., , and . J. Comb. Optim., 31 (2): 846-864 (2016)A Randomised Approximation Algorithm for the Hitting Set Problem., , and . WALCOM, volume 7748 of Lecture Notes in Computer Science, page 101-113. Springer, (2013)On the Query Complexity of Black-Peg AB-Mastermind., , , and . CoRR, (2016)A randomised approximation algorithm for the hitting set problem., , and . Theor. Comput. Sci., (2014)A Randomised Approximation Algorithm for the Partial Vertex Cover Problem in Hypergraphs., , and . MedAlg, volume 7659 of Lecture Notes in Computer Science, page 174-187. Springer, (2012)Randomized Approximation for the Set Multicover Problem in Hypergraphs., , and . Algorithmica, 74 (2): 574-588 (2016)Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection., , , , and . JORS, 66 (4): 615-626 (2015)On the Query Complexity of Black-Peg AB-Mastermind., , , and . Games, 9 (1): 2 (2018)Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation., and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 443-447. Springer, (2013)