Abstract
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.
This work was done while the first three authors were postdoctoral fellows at TU Berlin. Research supported by the European Regional Development Fund (ERDF).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggarwal, V., Aneja, Y.P., Nair, K.P.K.: Minimal spanning tree subject to a side constraint. Computers & Operations Research 9(4), 287–296 (1982)
Beasley, J., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks 19, 379–394 (1989)
Camerini, P., Galbiati, G., Maffioli, F.: Random pseudo-polynomial algorithms for exact matroid problems. Journal of Algorithms 13, 258–273 (1992)
Frank, A., Tardos, É.: Generalized polymatroids and submodular flows. Mathematical Programming 42, 489–563 (1988)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Guignard, M., Rosenwein, M.B.: An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20(3), 345–359 (1990)
Hassin, R., Levin, A.: An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM Journal on Computing 33(2), 261–268 (2004)
Hong, S.-P., Chung, S.-J., Park, B.H.: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters 32(3), 233–239 (2004)
Iwata, S.: On matroid intersection adjacency. Discrete Mathematics 242, 277–281 (2002)
Lovász, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)
Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. In: Proc. 22nd Int. Colloquium on Automata, Languages and Programming, pp. 487–498 (1995)
Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4(4), 414–424 (1979)
Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105–113 (1987)
Naor, J., Shachnai, H., Tamir, T.: Personal communication (2007)
Naor, J., Shachnai, H., Tamir, T.: Real-time scheduling with a budget. Algorithmica 47(3), 343–364 (2007)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)
Papadimitriou, C., Yannakakis, M.: The complexity of restricted spanning tree problems. Journal of the ACM 29(2), 285–309 (1982)
Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem (extended abstract). In: Proc. 5th Scandinavian Workshop on Algorithms and Theory, pp. 66–75 (1996)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Springer, Heidelberg (2003)
Shmoys, D.B., Tardos, É.: Scheduling unrelated machines with costs. In: Proc. 4th Symposium on Discrete Algorithms, pp. 448–454 (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, A., Bonifaci, V., Grandoni, F., Schäfer, G. (2008). Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle . In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)