Article

Free access

When trees collide: an approximation algorithm for the generalized Steiner problem on networks

Authors:

Ajit Agrawal,

Philip Klein,

R. RaviAuthors Info & Claims

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

Pages 134 - 144

https://doi.org/10.1145/103418.103437

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

Y. P. Aneja, "An integer linear programming approach to the Steiner problem in graphs', Networks, vol. 10 (1980) 167-178.

Crossref

Google Scholar

[2]

C. J. Colbourn, "Edge-packings of graphs and network reliability", J. Discrete Math., vol. 75 (1988) pp. 49-61.

Digital Library

Google Scholar

[3]

J. Edmonds, and E. L. Johnson, "Matching, Euler tours and the Chinese postman", Math. Programming, vol. 5 (#973) pp. 88-124.

Digital Library

Google Scholar

[4]

C. E1-Arbi, "One heuristique pour le problem de l'arbre de Steiner", R.A.LR.O. Operations Research, vol. 15 (1978), pp. 207-212.

Crossref

Google Scholar

[5]

M. X. Goemans, and D. J. Bertsimas, "Survivable Networks, Linear Programming Relaxations and the Parsimonious Property", OR 216-90, Center for Operations B.esearch, MIT (1990).

Google Scholar

[6]

A. J a in, "Probabilistic analysis of an LP relaxation bound for the Steiner problem in networks", Networks, vol. 19 (1989), pp. T93-80#.

Google Scholar

[7]

R. M. Karp, "Reducibility among combinatorial problems", in R. E. Miller and 3. W. Thatcher (eds.), Complexity of Computer Computations. Plenum Press, New York (1972) pp. ss-10s.

Google Scholar

[8]

P. N. Klein, A. Agrawal, R. Ravi, and S. Rao, "Approximation through multicommodity flow", 31st Annual Syrup. on Foundations o.f Comp. Sci., (1990), pp. 726-737.

Google Scholar

[9]

L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees", Acts Informatica, vol. 15 (1981), pp. 141-145.

Digital Library

Google Scholar

[10]

L. Ldvasz, "An algorithmic theory of numbers, graphs and convexity". SIAM, Philadelphia (1986).

Google Scholar

[11]

M. Minoux, "Network synthesis and optimum network design problems: models, solution methods and applications", Networks, vol. 19 (1989) pp. 313-360.

Crossref

Google Scholar

[12]

3. Plesnik, "A bound for the Steiner tree problem in graphs", Math. Slovaca, vol. 31 (1981) pp. 155-163.

Google Scholar

[13]

V.J. Rayward-Smith, "The computation of nearly minimal Steiner trees in graphs", Int. J. Math. Educ. Sci. Tech., vol. 14 (1983), pp. 15-23.

Crossref

Google Scholar

[14]

A. Segev, "The node-weighted Steiner tree problem", Networks, vol. 17(1987) pp. 1-17.

Digital Library

Google Scholar

[15]

G. F. Sullivan, "Approximation algorithms for Steiner tree problems", Tech. Rep. 249, Dept. of Comp. Sci., Yale Univ. (1982).

Google Scholar

[16]

H. Suzuki, T. Akama, and T. Nishizeki, "Finding Steiner forests in planar graphs", 1st Ann. A CM-SIAM Syrup. on Disc. AIg. (1990), pp. 444-453:

Digital Library

Google Scholar

[17]

H. Takahashi, and A. Matsuyama, " An approximate solution for the Steiner problem in graphs", Math. Japonica (1980) pp. 573-577.

Google Scholar

[18]

R. E. Tarjan, "Efficiency of a good but not linear set union algorithm", J. Assoc. Comput. Mach., vol. # (1975), pp. 215-225.

Digital Library

Google Scholar

[19]

L. G. Valiant, "The complexity of enumeration and reliability problems", Siam J. Comput., vol. 8 (1979), pp. 410-421.

Digital Library

Google Scholar

[20]

Pawel Winter, "Steiner Problem in Networks : A Survey", BIT 25 (1985), pp. 485.496.

Digital Library

Google Scholar

[21]

Pawel Winter, "Generalized Steiner Problem in Outerplanar graphs", Networks (1987), pp. 129-167.

Digital Library

Google Scholar

[22]

R. T. Wong, "Worst-case analysis of network design problem heuristics", SIAM J. Alg. Disc. Math., vol. i (1980), pp. 51-63.

Crossref

Google Scholar

[23]

R. T. Wong, "A dual ascent approach for Steiner tree problems on a directed graph", Math. Program., vol. $8, (1984) pp. 271-287.

Crossref

Google Scholar

Cited By

View all

Ahmadi AGholami IHajiaghayi MJabbarzade PMahdavi MMohar BShinkar IO'Donnell R(2024)Prize-Collecting Steiner Tree: A 1.79 ApproximationProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649789(1641-1652)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649789
Busch CChen DFiltser AHathcock DHershkowitz DRajaraman R(2023)One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00012(60-76)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00012
Bhadra Pratap Singh VSingh PJain DPandey ADas S(2022)Hierarchical Cluster Analysis Implementation Using the Algorithm of Clustering Using Representatives2022 IEEE IAS Global Conference on Emerging Technologies (GlobConET)10.1109/GlobConET53749.2022.9872414(993-998)Online publication date: 20-May-2022
https://doi.org/10.1109/GlobConET53749.2022.9872414
Show More Cited By

Index Terms

When trees collide: an approximation algorithm for the generalized Steiner problem on networks
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. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Graph algorithms analysis
      1. Network flows

Recommendations

When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

We give the first approximation algorithm for the generalized network Steiner problem, a problem in network design. An instance consists of a network with link-costs and, for each pair $\{i,j\}$ of nodes, an edge-connectivity requirement $r_{ij}$. The ...
Rank-Balanced Trees

Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the ...
Multi-splay trees

Comments

Information & Contributors

Information

Published In

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

January 1991

572 pages

ISBN:0897913973

DOI:10.1145/103418

Chairmen:
Cris Koutsougeras
Tulane Univ., New Orleans, LA
,
Jeff Vitter
Brown Univ., Providence, RI

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: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC91

Sponsor:

SIGACT

STOC91: 23rd Annual ACM Symposium on Theory of Computing

May 5 - 8, 1991

Louisiana, New Orleans, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

51
Total Citations
View Citations
1,178
Total Downloads

Downloads (Last 12 months)178
Downloads (Last 6 weeks)23

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ahmadi AGholami IHajiaghayi MJabbarzade PMahdavi MMohar BShinkar IO'Donnell R(2024)Prize-Collecting Steiner Tree: A 1.79 ApproximationProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649789(1641-1652)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649789
Busch CChen DFiltser AHathcock DHershkowitz DRajaraman R(2023)One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00012(60-76)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00012
Bhadra Pratap Singh VSingh PJain DPandey ADas S(2022)Hierarchical Cluster Analysis Implementation Using the Algorithm of Clustering Using Representatives2022 IEEE IAS Global Conference on Emerging Technologies (GlobConET)10.1109/GlobConET53749.2022.9872414(993-998)Online publication date: 20-May-2022
https://doi.org/10.1109/GlobConET53749.2022.9872414
Jia XHou BLiu W(2021)An Approximation Algorithm for the Generalized Prize-Collecting Steiner Forest Problem with Submodular PenaltiesJournal of the Operations Research Society of China10.1007/s40305-021-00355-810:1(183-192)Online publication date: 2-Jul-2021
https://doi.org/10.1007/s40305-021-00355-8
Çivril A(2019)Approximation of Steiner forest via the bidirected cut relaxationJournal of Combinatorial Optimization10.1007/s10878-019-00444-8Online publication date: 30-Aug-2019
https://doi.org/10.1007/s10878-019-00444-8
Zhang ZDai F(2019)Construction of Distributed Virtual Backbone Network in Tactical Communication NetworkCommunications, Signal Processing, and Systems10.1007/978-981-13-6264-4_68(569-576)Online publication date: 4-May-2019
https://doi.org/10.1007/978-981-13-6264-4_68
Arora SKale S(2016)A Combinatorial, Primal-Dual Approach to Semidefinite ProgramsJournal of the ACM10.1145/283702063:2(1-35)Online publication date: 4-May-2016
https://dl.acm.org/doi/10.1145/2837020
Schäfer G(2016)Steiner ForestEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_402(2099-2102)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_402
Demaine EHajiaghayi MKlein P(2014)Node-Weighted Steiner Tree and Group Steiner Tree in Planar GraphsACM Transactions on Algorithms10.1145/260107010:3(1-20)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1145/2601070
Hajiaghayi MLiaghat VPanigrahi D(2014)Near-Optimal Online Algorithms for Prize-Collecting Steiner ProblemsAutomata, Languages, and Programming10.1007/978-3-662-43948-7_48(576-587)Online publication date: 2014
https://doi.org/10.1007/978-3-662-43948-7_48
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