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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Berger, A., Bonifaci, V., Grandoni, F., & Schäfer, G. (2008). Budgeted matching and budgeted matroid intersection via the gasoline puzzle. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5035 LNCS, pp. 273–287). https://doi.org/10.1007/978-3-540-68891-4_19
Mendeley helps you to discover research relevant for your work.