The following pages link to Polylogarithmic inapproximability (Q3581278):
Displayed 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- The relation of connected set cover and group Steiner tree (Q441864) (← links)
- Complexity and approximation of the connected set-cover problem (Q453623) (← links)
- On the hardness of full Steiner tree problems (Q491161) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Complete partitions of graphs (Q949754) (← links)
- Parameterized complexity of team formation in social networks (Q1704854) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- On full Steiner trees in unit disk graphs (Q2349739) (← links)
- Approximability of capacitated network design (Q2354026) (← links)
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Bounded-hops power assignment in ad hoc wireless networks (Q2492211) (← links)
- The polymatroid Steiner problems (Q2569165) (← links)
- A greedy approximation algorithm for the group Steiner problem (Q2581556) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
- Steiner Problems with Limited Number of Branching Nodes (Q2868654) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- (Q3304124) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Spider Covering Algorithms for Network Design Problems (Q4689626) (← links)
- (Q5009500) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- How to Secure Matchings Against Edge Failures (Q5090488) (← links)
- Adaptive Submodular Ranking and Routing (Q5130512) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- How to Secure Matchings against Edge Failures (Q5157391) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
- (Q5743494) (← links)