The following pages link to Saving an epsilon (Q3581401):
Displaying 50 items.
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Online network design with outliers (Q334928) (← links)
- Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- A unified approach to approximating partial covering problems (Q633845) (← links)
- Approximation algorithms for the partition vertex cover problem (Q744047) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- A simple approximation algorithm for minimum weight partial connected set cover (Q1680500) (← links)
- Virtual machine placement for minimizing connection cost in data center networks (Q1751257) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design (Q2015804) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- The minimum degree group Steiner problem (Q2065790) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Degree-constrained \(k\)-minimum spanning tree problem (Q2221985) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- Solving energy issues for sweep coverage in wireless sensor networks (Q2357168) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
- Approximating the \(k\)-traveling repairman problem with repair times (Q2457300) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- Approximation Algorithms for Generalized Bounded Tree Cover (Q2803829) (← links)
- Balls and Funnels: Energy Efficient Group-to-Group Anycasts (Q2817865) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems (Q4571047) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- (Q5136319) (← links)
