Many birds with one stone: Multi-objective approximation algorithms

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129585, Issue , 1993, Pages 438-447

  Ravil, R ^a   Marathe, M V ^b   Ravi, S S ^b   Rosenkrantz, J D ^b   Hunt, H B ^b  

^a BROWN UNIVERSITY   (United States)

^b STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; COSTS; POLYNOMIAL APPROXIMATION; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

BOUNDED NETWORK; DESIGN OBJECTIVES; GENERALIZED STEINER FORESTS; MULTI OBJECTIVE; NETWORK DESIGN PROBLEMS; PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; TRIANGLE INEQUALITY;

APPROXIMATION ALGORITHMS; ALGORITHMS;

GENERALIZED STEINER FORESTS; MULTIOBJECTIVE APPROXIMATION ALGORITHMS; SPANNING TREES; STEINER TREES;

EID: 0027148656     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/167088.167209     Document Type: Conference Paper

References (25)

1. A. Agrawal, P. Klein, and R. Ravi, "When trees collide: An approximation algorithm for the generalized Steiner tree problem on networks, " Proc., 23rd Annual ACM STOC (1991), pp. 134-144.
2. A. Agrawal, P. Klein, and R. Ravi, "Near-optimal nested dissection, " submitted to SI AM J. on Computing. A preliminary version appeared as P. Klein, A. Agrawal, R. Ravi, and S. Rao, "Approximation through multicommodity flow, " in Proc. 31th Annual IEEE FOCS (1990), pp. 726-737.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading MA., 1974.
4. J. Bar-Ilan and D. Peleg, "Approximation algorithms for selecting network centers (Preliminary version), " LNCS 519, Proceedings, 2nd Workshop, WADS '91, Algorithms and Data Structures series, Springer- Verlag, pp. 343-354.
5. C. W. Duin and A. Volgenant, "Some generalizations of the Steiner problem in graphs, " Networks, 17, pp. 353-364, (1987).
6. J. Edmonds and E. L. Johnson, "Matching, Euler tours and the Chinese postman", Math. Prog. 5, (1973), pp. 88-124.
7. M. Furer and B. Raghavachari, "An AfC approximation algorithm for the minimum degree spanning tree problem, " Proc., 28th Annual Allerton Conference (1990), pp. 274-281.
8. M. Furer and B. Raghavachari, "Approximating the minimum degree spanning tree to within one from the optimal degree, " Proc., 3rd Annual ACM-SIAM SODA (1992), pp. 317-324.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory of NP- completeness, W. H. Freeman, San Francisco (1979).
10. M. X. Goemans and D. P. Williamson, "A general approximation technique for constrained forest problems, " Proc. 3rd Annual ACM-SIAM SODA (1992), pp. 307-316.
11. D. S. Hochbaum and D. B. Shmoys, "An unified approach to approximation algorithms for bottleneck problems, " J ACM, Vol. 33, No. 3, pp. 533-550, (July 1986).
12. F. K. Hwang and D. S. Richards, "Steiner tree problems, " Networks, Vol. 22, No. 1, pp. 55-90 (1992).
13. A. Iwainsky, E. Canuto, O. Taraszow, and A. Villa, "Network decomposition for the optimization of connection structures, " Networks, 16, pp. 205-235, (1986).
14. S. Khuller, B. Raghavachari, and N. Young, "Balancing Minimum Spanning and Shortest Path Trees, " Proc, 4th Annual ACM-SIAM SODA (1993), pp. 243250.
15. P. Klein and R. Ravi, "A nearly best-possible approximation for node-weighted Steiner trees, " to appear in Proc., IPCO III (1993).
16. F. T. Leighton and S. Rao, "An approximate mix- flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms, " Proc., 29th Annual IEEE FOCS (1988), pp. 422-431.
17. J.-H. Lin and J. S. Vitter, "e-Approximations with minimum packing constraint violation, " Proc., 24th Annual ACM STOC (1992), pp. 771-782.
18. L. Lovasz and M. D. Plummer, Matching theory, Akademiai Kiado, Budapest (1986).
19. C. Lund and M. Yannakakis, "On the Hardness of Approximating Minimization Problems, " in these proceedings.
20. J. S. B. Mitchell, C. Piatko, and E. M. Arkin, "Computing a shortest fc-link path in a polygon", Proc., 33rd Annual IEEE FOCS (1992), pp. 573-582.
21. R. G. Parker and R. L. Rardin, "Guaranteed performance heuristic for the bottleneck traveling salesman problem, " Oper. Res. Lett. 6, pp. 269-272, (1982).
22. R. Ravi, B. Raghavachari, and P. N. Klein, "Approximation through local optimality: Designing networks with small degree, " Proc., 12th Annual Cont, on FST&TCS (1992), LNCS 652, pp. 279-290.
23. D. J. Rosenkrantz, R. E. Stearns and P. M. Lewis II, "An analysis of several heuristics for the traveling salesman problem, " SIAM J. Computing, 6(3), pp. 563-581, 1977.
24. D. B. Shmoys and E. Tardos, "Scheduling unrelated parallel machines with costs, " Proc., 4th Annual ACM-SIAM SODA (1993), pp. 448-454.
25. P. Winter, "Steiner problem in networks: A survey, " BIT 25 (1985), pp. 485-496.