Euclidean prize-collecting Steiner forest (Q2429324): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-011-9491-8
@@ Property / DOI: 10.1007/s00453-011-9491-8 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-011-9491-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2096477872
@@ Property / OpenAlex ID: W2096477872 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
+Normal rank
@@ Property / cites work @@
+The prize collecting traveling salesman problem
@@ Property / cites work: The prize collecting traveling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Assignment problem in content distribution networks
+Normal rank
@@ Property / cites work @@
+Euclidean Prize-Collecting Steiner Forest
@@ Property / cites work: Euclidean Prize-Collecting Steiner Forest / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
+Normal rank
@@ Property / cites work @@
+Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth
+Normal rank
@@ Property / cites work @@
+The Steiner problem with edge lengths 1 and 2
@@ Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+A constant-factor approximation algorithm for the \(k\)-MST problem
+Normal rank
@@ Property / cites work @@
+Sparsest cuts and concurrent flows in product graphs.
+Normal rank
@@ Property / cites work @@
+Q2934724
@@ Property / cites work: Q2934724 / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Paths in Planar Graphs with Constant Congestion
+Normal rank
@@ Property / cites work @@
+Multicommodity flow, well-linked terminals, and routing problems
+Normal rank
@@ Property / cites work @@
+Q4537735
@@ Property / cites work: Q4537735 / rank @@
+Normal rank
@@ Property / cites work @@
+Saving an epsilon
@@ Property / cites work: Saving an epsilon / rank @@
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Embedding tree metrics into low-dimensional Euclidean spaces
+Normal rank
@@ Property / cites work @@
+Dial a Ride from k-Forest
@@ Property / cites work: Dial a Ride from k-Forest / rank @@
+Normal rank
@@ Property / cites work @@
+The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
+Normal rank
@@ Property / cites work @@
+Prize-Collecting Steiner Networks via Iterative Rounding
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / cites work @@
+Q4952698
@@ Property / cites work: Q4952698 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828931
@@ Property / cites work: Q4828931 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
+Normal rank
@@ Property / cites work @@
+Product Multicommodity Flow in Wireless Networks
@@ Property / cites work: Product Multicommodity Flow in Wireless Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems
+Normal rank
@@ Property / cites work @@
+Spanning Trees—Short or Small
@@ Property / cites work: Spanning Trees—Short or Small / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for Graph Steiner Tree Approximation
+Normal rank
@@ Property / cites work @@
+Approximating the Single-Sink Link-Installation Problem in Network Design
+Normal rank
@@ Property / cites work @@
+Q2934723
@@ Property / cites work: Q2934723 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00453-011-9491-8
@@ Property / DOI: 10.1007/S00453-011-9491-8 / rank @@
+Normal rank