scientific article; zbMATH DE number 6783450
From MaRDI portal
Publication:5365098
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)
Recommendations
- Prize-collecting steiner network problems
- Prize-collecting Steiner network problems
- Strong lower bounds for the prize collecting Steiner problem in graphs
- Generating lower bounds for the prize collecting Steiner problem in graphs
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- scientific article; zbMATH DE number 1445375
- Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs
- Prize-collecting Steiner networks via iterative rounding
- Variations of the prize‐collecting Steiner tree problem
- Solving the prize‐collecting Euclidean Steiner tree problem
Cited in
(26)- Improved Steiner tree algorithms for bounded treewidth
- Euclidean prize-collecting Steiner forest
- The prize-collecting call control problem on weighted lines and rings
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
- Prize-collecting steiner network problems
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- Euclidean Prize-Collecting Steiner Forest
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics
- A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs
- A (1+\varepsilon)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
- Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio
- An improved approximation guarantee for prize-collecting TSP
- Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
- Prize-collecting forest with submodular penalties: improved approximation
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- A better-than-1.6-approximation for prize-collecting TSP
- A better-than-1.6-approximation for prize-collecting TSP
- Approximation algorithm for unrooted prize-collecting forest with multiple components and its application on prize-collecting sweep coverage
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365098)
