Improved approximation algorithms for prize-collecting Steiner tree and TSP
From MaRDI portal
(Redirected from Publication:3020008)
Recommendations
- Elementary approximation algorithms for prize collecting Steiner tree problems
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- scientific article; zbMATH DE number 1445375
- scientific article; zbMATH DE number 6783450
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
Cited in
(53)- On the Exact Solution of Prize-Collecting Steiner Tree Problems
- Approximation algorithms for prize-collecting capacitated network design problems
- Elementary approximation algorithms for prize collecting Steiner tree problems
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- Prize-collecting TSP with a budget constraint
- Serving rides of equal importance for time-limited dial-a-ride
- A 3/2-approximation algorithm for some minimum-cost graph problems
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
- Complexity and approximation for traveling salesman problems with profits
- Variations of the prize‐collecting Steiner tree problem
- An Efficient Approximation Algorithm for the Steiner Tree Problem
- A note on the prize collecting traveling salesman problem
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- The complexity landscape of fixed-parameter directed Steiner network problems
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties
- The fractional prize-collecting Steiner tree problem on trees (extended abstract)
- Robust optimization for routing problems on trees
- Approximation algorithms for node-weighted directed Steiner problems
- Maximizing rides served for dial-a-ride on the uniform metric
- A better-than-1.6-approximation for prize-collecting TSP
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
- The prize-collecting call control problem on weighted lines and rings
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- Approximation algorithms for group prize-collecting and location-routing problems
- A better-than-1.6-approximation for prize-collecting TSP
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- Local search algorithms for \(k\)-median and \(k\)-facility location problems with linear penalties
- Prize-collecting asymmetric traveling salesman problem admits polynomial time approximation within a constant ratio
- Solving Steiner trees: Recent advances, challenges, and perspectives
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
- The restricted Chinese postman problems with penalties
- Bicriterial approximation for the incremental prize-collecting Steiner-tree problem
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Prize-collecting forest with submodular penalties: improved approximation
- An improved approximation guarantee for prize-collecting TSP
- On the integrality gap of the prize-collecting Steiner forest LP
- Approximating minimum-cost connected \(T\)-joins
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- A simple rounding scheme for multistage optimization
- A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics
- An improved algorithm for the Steiner tree problem with bounded edge-length
- LP-based algorithms for multistage minimization problems
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
- 2-approximation for prize-collecting Steiner forest
- A 4-approximation algorithm for k-prize collecting Steiner tree problems
- Erratum to “Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems”
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
This page was built for publication: Improved approximation algorithms for prize-collecting Steiner tree and TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3020008)
