Pages that link to "Item:Q4512573"
From MaRDI portal
The following pages link to A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem (Q4512573):
Displaying 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- The minimum vulnerability problem (Q487032) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- Local search algorithm for universal facility location problem with linear penalties (Q506471) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- On approximating planar metrics by tree metrics. (Q1603386) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Generalized network design problems. (Q1810478) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- 2-node-connectivity network design (Q2117701) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- On full Steiner trees in unit disk graphs (Q2349739) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Hedging uncertainty: approximation algorithms for stochastic optimization problems (Q2494510) (← links)
- Some formulations for the group Steiner tree problem (Q2500536) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- APPROXIMATION ALGORITHMS FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM WITH DISCRETE AND CONTINUOUS NEIGHBORHOODS (Q3636315) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- The Bursty Steiner Tree Problem (Q4639923) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002844) (← links)
- (Q5009500) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
