A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
From MaRDI portal
Publication:4512573
DOI10.1006/JAGM.2000.1096zbMATH Open0962.68136OpenAlexW2610052675MaRDI QIDQ4512573FDOQ4512573
Authors: Naveen Garg, Goran Konjevod, R. Ravi 
Publication date: 5 November 2000
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1096
Recommendations
Cited In (64)
- A comprehensive survey on the generalized traveling salesman problem
- The Bursty Steiner Tree Problem
- Adaptive Submodular Ranking and Routing
- Multi-candidate carpooling routing problem and its approximation algorithms
- Locating service and charging stations
- Title not available (Why is that?)
- \(k\)-Transmitter watchman routes
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- Network-design with degree constraints
- On fixed cost \(k\)-flow problems
- A polylogarithmic approximation for computing non-metric terminal Steiner trees
- On full Steiner trees in unit disk graphs
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Improved approximation algorithms for directed Steiner forest
- Title not available (Why is that?)
- On some network design problems with degree constraints
- An improved approximation scheme for the Group Steiner Problem
- Online Buy-at-Bulk Network Design
- THE MINIMUM GUARDING TREE PROBLEM
- On approximating degree-bounded network design problems
- The minimum degree group Steiner problem
- The relation of connected set cover and group Steiner tree
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
- Approximating fault-tolerant group-Steiner problems
- Watchman routes for lines and line segments
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- Approximation algorithms for group prize-collecting and location-routing problems
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set
- Some formulations for the group Steiner tree problem
- Complexity of minimum corridor guarding problems
- Title not available (Why is that?)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts
- The polymatroid Steiner problems
- A greedy approximation algorithm for the group Steiner problem
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- Title not available (Why is that?)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Exact and approximate equilibria for optimal group network formation
- The minimum vulnerability problem
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems
- A Spectral Approach to Network Design
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- On the hardness of full Steiner tree problems
- Generalized network design problems.
- A random-key genetic algorithm for the generalized traveling salesman problem
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- Efficient Black-Box Reductions for Separable Cost Sharing
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
- Approximating fault-tolerant group-Steiner problems
- Facility location with client latencies: linear programming based techniques for minimum latency problems
- Title not available (Why is that?)
- Local search algorithm for universal facility location problem with linear penalties
- On approximating planar metrics by tree metrics.
- Combination algorithms for Steiner tree variants
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- On approximation algorithms for the terminal Steiner tree problem
- Approximation algorithm for the group Steiner network problem
- Bounded Degree Group Steiner Tree Problems
- 2-node-connectivity network design
- A PTAS for the Steiner Forest Problem in Doubling Metrics
This page was built for publication: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4512573)
