Approximation algorithms for solving the line-capacitated minimum Steiner tree problem

DOI10.1007/s10898-022-01163-xzbMath1505.90106OpenAlexW4281739534MaRDI QIDQ2089871

Wencheng Wang, Suding Liu, Pengxiang Pan, Junran Lichen, Jianping Li

Publication date: 24 October 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01163-x

zbMATH Keywords

combinatorial optimizationapproximation algorithmsexact algorithmsline-capacitated Steiner treeslocations of lines

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Transitions in geometric minimum spanning trees
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Approximation algorithms for a capacitated network design problem
• Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
• Optimal interconnection trees in the plane. Theory, algorithms and applications
• Survivable network design: the capacitated minimum spanning network problem
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• On the Complexity of Numerical Analysis
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• The complexity of the capacitated tree problem
• On Steiner Minimal Trees with Rectilinear Distance
• The Complexity of Computing Steiner Minimal Trees
• Spanning Trees and Optimization Problems
• Data Structures for Weighted Matching and Extensions to b -matching and f -factors
• Fibonacci heaps and their uses in improved network optimization algorithms
• Maximum matching and a polyhedron with 0,1-vertices
• Combinatorial optimization. Theory and algorithms.
• Steiner tree problems
• Solving Steiner trees: Recent advances, challenges, and perspectives

This page was built for publication: Approximation algorithms for solving the line-capacitated minimum Steiner tree problem