Budgeted matching and budgeted matroid intersection via the gasoline puzzle

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5035 LNCS, Issue , 2008, Pages 273-287

  Berger, André ^a   Bonifaci, Vincenzo ^b,c   Grandoni, Fabrizio ^d   Schäfer, Guido ^e  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d UNIVERSITY OF ROME TOR VERGATA   (Italy)

^e TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AEROSPACE APPLICATIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; DYNAMIC PROGRAMMING; INTERSECTIONS; LINEAR PROGRAMMING; LIQUID FUELS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; NUCLEAR PROPULSION; OPTIMIZATION; PETROLEUM PRODUCTS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SET THEORY; SOLUTIONS; STANDARDS; WEIGHING;

ADJACENCY RELATIONS; BUDGET CONSTRAINTS; COMBINATORIAL OPTIMIZATION PROBLEMS (COPS); COMBINATORIAL STRUCTURES; FEASIBLE SOLUTIONS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; LA-GRANGIAN RELAXATION (LR); MATROID INTERSECTION; NEAR-OPTIMAL SOLUTIONS; NP-HARD; POLYNOMIAL TIME APPROXIMATION SCHEME (PTAS); POLYNOMIAL-TIME; POLYTOPE; SPRINGER (CO);

INTEGER PROGRAMMING;

EID: 45749086557     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68891-4_19     Document Type: Conference Paper

References (21)

1. 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)
2. Beasley, J., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks 19, 379-394 (1989)
3. Camerini, P., Galbiati, G., Maffioli, F.: Random pseudo-polynomial algorithms for exact matroid problems. Journal of Algorithms 13, 258-273 (1992)
4. Frank, A., Tardos, É.: Generalized polymatroids and submodular flows. Mathematical Programming 42, 489-563 (1988)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
6. Guignard, M., Rosenwein, M.B.: An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20(3), 345-359 (1990)
7. 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)
8. 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)
9. Iwata, S.: On matroid intersection adjacency. Discrete Mathematics 242, 277-281 (2002)
10. Lovász, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)
11. 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)
12. Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4(4), 414-424 (1979)
13. Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105-113 (1987)
14. Naor, J., Shachnai, H., Tamir, T.: Personal communication (2007)
15. Naor, J., Shachnai, H., Tamir, T.: Real-time scheduling with a budget. Algorith-mica 47(3), 343-364 (2007)
16. Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley, Chichester (1988)
17. Papadimitriou, C., Yannakakis, M.: The complexity of restricted spanning tree problems. Journal of the ACM 29(2), 285-309 (1982)
18. 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)
19. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)
20. Schrijver, A.: Combinatorial Optimization. Polyhedra and Efficiency. Springer, Heidelberg (2003)
21. Shmoys, D.B., Tardos, É.: Scheduling unrelated machines with costs. In: Proc. 4thSymposium on Discrete Algorithms, pp. 448-454 (1993)