On residual approximation in solution extension problems
From MaRDI portal
Recommendations
- On Residual Approximation in Solution Extension Problems
- Complexity and approximability of extended spanning star forest problems in general and complete graphs
- An improved approximation algorithm for the partial Latin square extension problem.
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- On Completing Latin Squares
Cites work
- 8/7-approximation algorithm for (1,2)-TSP
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
- A bounded approximation for the minimum cost 2-sat problem
- A fundamental problem in vehicle routing
- A linear-time approximation algorithm for the weighted vertex cover problem
- An approximation algorithm for the general routing problem
- An Approximation Algorithm for the Traveling Salesman Problem with Backhauls
- Approximating MIN 2-SAT and MIN 3-SAT
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Better approximation algorithms for the maximum internal spanning tree problem
- Combinatorial optimization. Theory and algorithms.
- Dynamic Programming Treatment of the Travelling Salesman Problem
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- scientific article; zbMATH DE number 772760 (Why is no real title available?)
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- scientific article; zbMATH DE number 7053391 (Why is no real title available?)
- Improved approximations for TSP with simple precedence constraints
- Lower bounds based on the exponential time hypothesis
- Network flows. Theory, algorithms, and applications.
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- On Residual Approximation in Solution Extension Problems
- On the complexity of k-SAT
- On the complexity of scaffolding problems: from cliques to sparse graphs
- On the Computational Complexity of Combinatorial Problems
- On the shortest spanning subtree of a graph and the traveling salesman problem
- P-Complete Approximation Problems
- Precoloring extension on unit interval graphs
- Precoloring extension. I: Interval graphs
- Restricted delivery problems on a network
- Shortest paths algorithms: Theory and experimental evaluation
- The Traveling Salesman Problem with Distances One and Two
- The traveling salesman problem. A computational study.
- Which problems have strongly exponential complexity?
Cited in
(4)
This page was built for publication: On residual approximation in solution extension problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1631675)
