On Residual Approximation in Solution Extension Problems
From MaRDI portal
Publication:2958338
DOI10.1007/978-3-319-48749-6_34zbMath1470.90110OpenAlexW2544451952MaRDI QIDQ2958338
Valentin Pollet, Annie Chateau, Mathias Weller, Rodolphe Giroudeau, Jean-Claude Konig
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_34
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bounded approximation for the minimum cost 2-sat problem
- An approximation algorithm for the general routing problem
- Precoloring extension. I: Interval graphs
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Approximating MIN 2-SAT and MIN 3-SAT
- Better approximation algorithms for the maximum internal spanning tree problem
- Precoloring extension on unit interval graphs
- On the Complexity of Scaffolding Problems: From Cliques to Sparse Graphs
- A linear-time approximation algorithm for the weighted vertex cover problem
- A fundamental problem in vehicle routing
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- Restricted delivery problems on a network
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
This page was built for publication: On Residual Approximation in Solution Extension Problems
