A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
From MaRDI portal
(Redirected from Publication:4512573)
Recommendations
Cited in
(78)- Approximation algorithms for group prize-collecting and location-routing problems
- On approximation algorithms for the terminal Steiner tree problem
- On approximating planar metrics by tree metrics.
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Generalized network design problems.
- The minimum degree group Steiner problem
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- 2-node-connectivity network design
- On approximating degree-bounded network design problems
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set
- On full Steiner trees in unit disk graphs
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- Watchman routes for lines and line segments
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Some formulations for the group Steiner tree problem
- The polymatroid Steiner problems
- A greedy approximation algorithm for the group Steiner problem
- On fixed cost k-flow problems
- Combination algorithms for Steiner tree variants
- An improved approximation scheme for the Group Steiner Problem
- Balls and funnels: energy efficient group-to-group anycasts
- Approximating fault-tolerant group-Steiner problems
- An FPTAS for the fractional group Steiner tree problem
- Network-design with degree constraints
- Approximation algorithm for the group Steiner network problem
- On some network design problems with degree constraints
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS
- A polylogarithmic approximation for computing non-metric terminal Steiner trees
- Improved approximation algorithms for directed Steiner forest
- scientific article; zbMATH DE number 1303564 (Why is no real title available?)
- The relation of connected set cover and group Steiner tree
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- Complexity of minimum corridor guarding problems
- Online Buy-at-Bulk Network Design
- The bursty Steiner tree problem
- scientific article; zbMATH DE number 2119643 (Why is no real title available?)
- The minimum vulnerability problem
- On the hardness of full Steiner tree problems
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Survivable network design for group connectivity in low-treewidth graphs
- Bounded Degree Group Steiner Tree Problems
- Local search algorithm for universal facility location problem with linear penalties
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- A Spectral Approach to Network Design
- Adaptive submodular ranking and routing
- A PTAS for the Steiner forest problem in doubling metrics
- THE MINIMUM GUARDING TREE PROBLEM
- scientific article; zbMATH DE number 2230214 (Why is no real title available?)
- $O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- \(k\)-Transmitter watchman routes
- Locating service and charging stations
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
- A comprehensive survey on the generalized traveling salesman problem
- Multi-candidate carpooling routing problem and its approximation algorithms
- Simple approximations for general spanner problems
- Approximation algorithms for _p-shortest path and _p-group Steiner tree
- A logarithmic integrality gap for generalizations of quasi-bipartite instances of directed Steiner tree
- Degrees and network design: new problems and approximations
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Adaptive-adversary-robust algorithms via small copy tree embeddings
- A new approach for approximating directed rooted networks
- Approximating sparsest cut in low-treewidth graphs via combinatorial diameter
- Exact and approximate equilibria for optimal group network formation
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
- From directed Steiner tree to directed polymatroid Steiner tree in planar graphs
- Survivable network design with group-to-group requirement
- An approximation algorithm for generalized connectivity problem on planar graphs
- Sweeping a domain with line-of-sight between covisible agents
- Approximating fault-tolerant group-Steiner problems
- A random-key genetic algorithm for the generalized traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
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)
