Iterative rounding for multi-objective optimization problems

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

Volumn 5757 LNCS, Issue , 2009, Pages 95-106

  Grandoni, Fabrizio ^a   Ravi, R ^b   Singh, Mohit ^c  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; BUDGET CONSTRAINT; FEASIBLE SOLUTION; FLEXIBLE TOOL; ITERATIVE ROUNDING; LENGTH FUNCTIONS; MATROIDS; MULTI OBJECTIVE; MULTI-OBJECTIVE OPTIMIZATION PROBLEM; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SPANNING TREE; STANDARD WEIGHTS;

BUDGET CONTROL; FUNCTION EVALUATION; GRAPH THEORY; MULTIOBJECTIVE OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70350405182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_9     Document Type: Conference Paper

References (29)

1. Aggarwal, V., Aneja, Y.P., Nair, K.P.K.: Minimal spanning tree subject to a side constraint. Computers & Operations Research 9, 287-296 (1982)
2. Bansal, N., Khandekar, R., Nagarajan, V.: Additive Guarantees for Degree Bounded Directed Network Design. In: STOC, pp. 769-778 (2008)
3. Barahona, F., Pulleyblank, W.R.: Exact arborescences, matchings and cycles. Discrete Applied Mathematics 16(2), 91-99 (1987)
4. Barichard, V., Ehrgott, M., Gandibleux, X., T'Kindt, V. (eds.): Multiobjective Programming and Goal Programming: Theoretical Results and Practical Applications. Lecture Notes in Economics and Mathematical Systems, vol. 618. Springer, Heidelberg (2009)
5. Beasley, J.E., Christofides, N.: An algorithm for the resource constrained shortest path problem. Networks 19, 379-394 (1989)
6. Berger, A.,Bonifaci, V.,Grandoni, F., Schäfer,G.: Budgeted matching and budgeted matroid intersection via the gasoline puzzle. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 273-287. Springer, Heidelberg (2008)
7. Biló, V., Goyal, V., Ravi, R., Singh, M.: On the Crossing Spanning Tree Problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 51-64. Springer, Heidelberg (2004)
8. Cheriyan, J., Vempala, S., Vetta, A.: Network design via iterative rounding of setpair relaxations. Combinatorica 26(3), 255-275 (2006)
9. Chinchuluun, A., Pardalos, P.M., Migdalas, A., Pitsoulis, L. (eds.): Pareto Optimality, Game Theory and Equilibria. Optimization and Its Applications, vol. 17 (2008)
10. Climacao, J.: Multicriteria Analysis. Springer, Heidelberg (1997)
11. Cunningham, W.H.: Testing Membership in Matroid Polyhedra. Journal of Combinatorial Theory B 36(2), 161-188 (1984)
12. Fleischer, L., Jain, K., Williamson, D.P.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. Journal of Computer and System Sciences 72(5), 838-867 (2006)
13. Guignard, M., Rosenwein, M.B.: An application of Lagrangean decomposition to the resource-constrained minimum weighted arborescence problem. Networks 20, 345-359 (1990)
14. Hartley, R.: Survey of Algorithms for Vector Optimization Problems. In: French, S., Hartley, R., Thomas, L.C., White, D.J. (eds.) Multiobjective Decision Making, pp. 1-34. Academic Press, London (1983)
15. Jain, K.: A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica 21, 39-60 (2001)
16. Lau, L.C., Naor, S., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. In: STOC, pp. 651-660 (2007)
17. Lau, L.C., Singh, M.: Additive approximation for bounded degree survivable network design. In: STOC, pp. 759-768 (2008)
18. Levin, A., Woeginger, G.J.: The constrained minimum weight sum of job completion times. Mathematical Programming 108, 115-126 (2006)
19. Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 487-498. Springer, Heidelberg (1995)
20. Melkonian, V., Tardos, E.: Algorithms for a Network Design Problem with Crossing Supermodular Demands. Networks 43, 4 (2004)
21. Mulmuley, K., Vazirani, U., Vazirani, V.: Matching is as Easy as Matrix Inversion. Combinatorica 7(1), 101-104 (1987)
22. Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of Web sources. In: FOCS, pp. 86-92 (2000)
23. Ravi, R.: Rapid rumor ramification: Approximating the minimum broadcast time. In: FOCS, pp. 202-213 (1994)
24. Ravi, R.: Matching Based Augmentations for Approximating Connectivity Problems. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 13-24. Springer, Heidelberg (2006)
25. Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem (extended abstract). In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66-75. Springer, Heidelberg (1996)
26. Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Many Birds with One Stone: Multi-objective Approximation Algorithms. In: STOC, pp. 438- 447 (1993)
27. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)
28. Shmoys, D.B., Tardos, E.: Scheduling unrelated machines with costs. In: SODA, pp. 448-454 (1993)
29. Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC, pp. 661-670 (2007)