Pages that link to "Item:Q4842113"
From MaRDI portal
The following pages link to When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks (Q4842113):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- A genetic algorithm for the maximum 2-packing set problem (Q2019714) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- Bayesian generalized network design (Q2202025) (← links)
- Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem (Q2253903) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- Pruning 2-connected graphs (Q2428662) (← links)
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy (Q2467439) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- LP Relaxation and Tree Packing for Minimum $k$-Cut (Q3300759) (← links)
- (Q3304124) (← links)
