Academic
Publications
Budgeted matching and budgeted matroid intersection via the gasoline puzzle

Budgeted matching and budgeted matroid intersection via the gasoline puzzle,10.1007/s10107-009-0307-4,Mathematical Programming,André Berger,Vincenzo B

Budgeted matching and budgeted matroid intersection via the gasoline puzzle   (Citations: 1)
BibTex | RIS | RefWorks Download
Many polynomial-time solvable combinatorial optimization problems become NP-hard if an additional complicating constraint is added to restrict the set of feasible solutions. In this paper, we consider two such problems, namely maximum-weight matching and maximum-weight matroid intersection with one additional budget constraint. We present the first polynomial-time approximation schemes for these problems. Similarly to other approaches for related problems, our schemes compute two solutions to the Lagrangian relaxation of the problem and patch them together to obtain a near-optimal solution. However, due to the richer combinatorial structure of the problems considered here, standard patching techniques do not apply. To circumvent this problem, we crucially exploit the adjacency relations on the solution polytope and, surprisingly, the solution to an old combinatorial puzzle.
Journal: Mathematical Programming , vol. 128, no. 1-2, pp. 355-372, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: