Pages that link to "Item:Q2875185"
From MaRDI portal
The following pages link to An improved LP-based approximation for steiner tree (Q2875185):
Displaying 50 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems (Q313789) (← links)
- Competitive and deterministic embeddings of virtual networks (Q391268) (← links)
- On the low-dimensional Steiner minimum tree problem in Hamming metric (Q393125) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- Definition and algorithms for reliable Steiner tree problem (Q498083) (← links)
- Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound (Q614043) (← links)
- Exact and approximate equilibria for optimal group network formation (Q719269) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Designing cost-sharing methods for Bayesian games (Q1733377) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Online covering salesman problem (Q1743496) (← links)
- Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
- Two-stage robust network design with exponential scenarios (Q1939662) (← links)
- Energy-efficient communication in multi-interface wireless networks (Q1946498) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty (Q2084632) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Strategyproof auction mechanisms for network procurement (Q2215560) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Approximability of minimum certificate dispersal with tree structures (Q2354400) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
- Network design with a discrete set of traffic matrices (Q2450673) (← links)
- A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs (Q2512658) (← links)
- Designing Cost-Sharing Methods for Bayesian Games (Q2819469) (← links)
- New Reoptimization Techniques applied to Steiner Tree Problem (Q2840741) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- Minimum Certificate Dispersal with Tree Structures (Q2898067) (← links)
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location (Q3009767) (← links)
- On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric (Q3010411) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (Q3012847) (← links)
- From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)
- Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem (Q4922116) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
