Article

Free access

Many birds with one stone: multi-objective approximation algorithms

Authors:

R. Ravi,

M. V. Marathe,

S. S. Ravi,

D. J. Rosenkrantz,

H. B. Hunt, IIIAuthors Info & Claims

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

Pages 438 - 447

https://doi.org/10.1145/167088.167209

Published: 01 June 1993 Publication History

PDF eReader

References

[1]

A. Agrawal, P. Klein, and R. Ravi, "When trees collide: an approximation algorithm for the generalized Steiner tree problem on networks," Proc., #.3rd Annual ACM STOC (1991), pp. 134-144.

Digital Library

Google Scholar

[2]

A. Agrawal, P. Klein, and R. Ravi, "Near-optimal nested dissection," submitted to SIAM Y. 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.

Google Scholar

[3]

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, Reading MA., 1974.

Digital Library

Google Scholar

[4]

J. Bar-Ilan and D. Peleg, "Approximation algorithms for selecting network centers (Preliminary version)," LNGS 519, Proceedings, #nd Workshop, WADS '91, Algorithms and Data Structures series, Springer- Verlag, pp. 343-354.

Google Scholar

[5]

C. W. Duin and A. Volgenant, "Some generalizations of the Steiner problem in graphs," Networks, 17, pp. sss-s64, (198r).

Google Scholar

[6]

J. Edmonds and E. L. Johnson, "Matching, Euler tours and the Chinese postman", Math. Protl. 5, (1973), pp. 88-124.

Digital Library

Google Scholar

[7]

M. F6rer and B. Raghavachari, "An A/'C approximation algorithm for the minimum degree spanning tree problem," Proc., #Sth Annual Allerton Conference (1990), pp. 274-281.

Google Scholar

[8]

M. Filter and B. Raghavachari, "Approximating the minimum degree spanning tree to within one from the optimal degree," Proc., 3rd Annual A CM-SIAM SODA (1992), pp. 317-324.

Digital Library

Google Scholar

[9]

M. R. Garey and D. S. Johnson, Computers and Intractability: A guide to the theory o.f NP- completeness, W. H. Freeman, San Francisco (1979).

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[11]

D. S. Hochbaum and D. B. Shmoys, "An unified approach to approximation algorithms for bottleneck problems," JACM, Vol. 33, No. 3, pp. 533-550, (July 1986).

Digital Library

Google Scholar

[12]

F. K. tiwang and D. S. Richards, "Steiner tree problems," Networks, Vol. 22, No. 1, pp. 55-90 (1992).

Crossref

Google Scholar

[13]

A. Iwainsky, E. Canuto, O. Taraszow, and A. Villa, "Network decomposition for the optimization of connection structures," Networks, 16, pp. 205-235, (1986).

Crossref

Google Scholar

[14]

S. Khuller, B. Raghavachari, and N. Young, "Balancing Minimum Spanning and Shortest Path Trees,'# Proc, 4th Annual ACM-SIAM SODA (1993), pp. 243- 250.

Digital Library

Google Scholar

[15]

P. Klein and R. Ravi, "A nearly best-possible approximation for node-weighted Steiner trees," to appear in Proc., IPCO III (1993).

Google Scholar

[16]

F. T. Leighton and S. Rax#, "An approximate maxflow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms," Proc., 29th Annual IEEE FOCS (1988), pp. 422-431.

Google Scholar

[17]

J.-H. Lin and J. S. Vitter, "e-approximations with minimum packing constraint violation," Proc., 24th Annual ACM STOC (1992), pp. 771-782.

Digital Library

Google Scholar

[18]

L. Lov#sz and M. D. Plummer, Matching theor$t, Akad#miai Kind6, Budapest (1986).

Google Scholar

[19]

(3. Lund and M. Yannakakis, "On the Hardness of Approximating Minimization Problems," in these proceedings.

Digital Library

Google Scholar

[20]

J. S. B. Mitchell, C. Piatko, and E. M. Arkin, "Computing a shortest k-link path in a polygon", Proco, 33rd Annual IEEE FOCS (1992), pp. 573-582.

Google Scholar

[21]

R. G. Parker and R. L. Rardin, "Guaranteed performance heuristic for the bottleneck traveling salesman problem," Oper. Res. Left. 6, pp. 269-272, (1982).

Google Scholar

[22]

R. Ravi, B. Raghavachari, and P. N. Klein, "Approximation through local optimality" Designing networks with small degree," Proc., 1P.th Annual Conf. on FST?JTCS (1992), LNCS 652, pp. 279-290.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[24]

D. B. Shmoys and E. Tardos, "Scheduling unrelated parallel machines with costs," Proc., 4th Annual A CM-SIAM SODA (1993), pp. 448-454.

Digital Library

Google Scholar

[25]

P. Winter, "Steiner problem in networks: a survey," BIT #5 (1985), pp. 485-496.

Digital Library

Google Scholar

Cited By

View all

Van Dyk MKlause KKoenemann JMegow N(2024)Fast Combinatorial Algorithms for Efficient SortationInteger Programming and Combinatorial Optimization10.1007/978-3-031-59835-7_31(418-432)Online publication date: 22-May-2024
https://doi.org/10.1007/978-3-031-59835-7_31
Ghoshal SSundar S(2023)A Hybrid Artificial Bee Colony Algorithm for the Degree-Constrained Minimum Spanning Tree ProblemICDSMLA 202110.1007/978-981-19-5936-3_62(671-680)Online publication date: 7-Feb-2023
https://doi.org/10.1007/978-981-19-5936-3_62
Laddha ASingh MVempala S(2022)Socially fair network design via iterative roundingOperations Research Letters10.1016/j.orl.2022.07.01150:5(536-540)Online publication date: Sep-2022
https://doi.org/10.1016/j.orl.2022.07.011
Show More Cited By

Index Terms

Many birds with one stone: multi-objective approximation algorithms
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Network flows
      2. Trees
  2. Mathematical analysis
    1. Functional analysis
      1. Approximation
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Graph algorithms analysis
      1. Network flows

Recommendations

Many Birds With One Stone: Multi-Objective Approximation Algorithms
Some Multiple Power Series with Zero-One Coefficients

The paper is concerned with sums of the type \[S_{n,j} = \sum {x_1^{a_1 } x_2^{a_2 } \cdots x_n^{a_n } } \quad (n > 1),\] where the summation is over either \[( * )\qquad ja_i \leqq a_1 + a_2 + \cdots + a_n \quad (1 \leqq j \leqq n;1 \leqq i \leqq ...
Approximate non-dominated sorting for evolutionary many-objective optimization

Non-dominated sorting has widely been adopted and shown to be very effective in dominance based evolutionary multi-objective optimization where the number of objectives is two or three. In dealing with many-objective optimization problems, where the ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

108
Total Citations
View Citations
763
Total Downloads

Downloads (Last 12 months)69
Downloads (Last 6 weeks)9

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Van Dyk MKlause KKoenemann JMegow N(2024)Fast Combinatorial Algorithms for Efficient SortationInteger Programming and Combinatorial Optimization10.1007/978-3-031-59835-7_31(418-432)Online publication date: 22-May-2024
https://doi.org/10.1007/978-3-031-59835-7_31
Ghoshal SSundar S(2023)A Hybrid Artificial Bee Colony Algorithm for the Degree-Constrained Minimum Spanning Tree ProblemICDSMLA 202110.1007/978-981-19-5936-3_62(671-680)Online publication date: 7-Feb-2023
https://doi.org/10.1007/978-981-19-5936-3_62
Laddha ASingh MVempala S(2022)Socially fair network design via iterative roundingOperations Research Letters10.1016/j.orl.2022.07.01150:5(536-540)Online publication date: Sep-2022
https://doi.org/10.1016/j.orl.2022.07.011
Biniaz A(2022)Euclidean Bottleneck Bounded-Degree Spanning Tree RatiosDiscrete & Computational Geometry10.1007/s00454-021-00286-467:1(311-327)Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1007/s00454-021-00286-4
Guo XKortsarz GLaekhanukit BLi SVaz DXian J(2022)On Approximating Degree-Bounded Network Design ProblemsAlgorithmica10.1007/s00453-022-00924-084:5(1252-1278)Online publication date: 1-May-2022
https://dl.acm.org/doi/10.1007/s00453-022-00924-0
Ghoshal SSundar S(2022)An Iterated Local Search Algorithm for the Degree-Constrained Minimum Spanning Tree ProblemArtificial Intelligence and Sustainable Computing10.1007/978-981-19-1653-3_27(347-358)Online publication date: 16-Nov-2022
https://doi.org/10.1007/978-981-19-1653-3_27
Kyriakis PPequito SBogdan P(2020)On the Stability and Fairness of Submodular Allocations2020 59th IEEE Conference on Decision and Control (CDC)10.1109/CDC42340.2020.9304168(2648-2653)Online publication date: 14-Dec-2020
https://dl.acm.org/doi/10.1109/CDC42340.2020.9304168
Singh KSundar S(2020)A hybrid genetic algorithm for the degree-constrained minimum spanning tree problemSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-019-04051-x24:3(2169-2186)Online publication date: 1-Feb-2020
https://dl.acm.org/doi/10.1007/s00500-019-04051-x
Istrate GBonchiş CBrînduşescu AElkind EVeloso MAgmon NTaylor M(2019)Attacking Power Indices by Manipulating Player ReliabilityProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331738(538-546)Online publication date: 8-May-2019
https://dl.acm.org/doi/10.5555/3306127.3331738
Merabet MMolnar MDurand S(2018)ILP formulation of the degree-constrained minimum spanning hierarchy problemJournal of Combinatorial Optimization10.1007/s10878-017-0159-436:3(789-811)Online publication date: 1-Oct-2018
https://dl.acm.org/doi/10.1007/s10878-017-0159-4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Many Birds With One Stone: Multi-Objective Approximation Algorithms

Some Multiple Power Series with Zero-One Coefficients

Approximate non-dominated sorting for evolutionary many-objective optimization