Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
From MaRDI portal
Publication:706963
Recommendations
- SOFSEM 2005: Theory and Practice of Computer Science
- On the stability of approximation for Hamiltonian path problems
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- Differential approximation results for the traveling salesman and related problems
- The approximability of the weighted Hamiltonian path completion problem on a tree
Cites work
- scientific article; zbMATH DE number 3910164 (Why is no real title available?)
- scientific article; zbMATH DE number 3918121 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1953087 (Why is no real title available?)
- scientific article; zbMATH DE number 2011863 (Why is no real title available?)
- scientific article; zbMATH DE number 1754594 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A greedy approximation algorithm for constructing shortest common superstrings
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Analysis of Christofides' heuristic: some paths are more difficult than cycles
- Approximate solution of NP optimization problems
- Approximation algorithms for indefinite quadratic programming
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- Approximation result toward nearest neighbor heuristic
- Better approximations for max TSP
- Bounds and Heuristics for Capacitated Routing Problems
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Completeness in approximation classes
- Differential approximation algorithms for some combinatorial optimization problems
- Differential approximation of NP-hard problems with equal size feasible solutions
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Heuristic evaluation techniques for bin packing approximation algorithms
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Non deterministic polynomial optimization problems and their approximations
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- P-Complete Approximation Problems
- Printer graphics for clustering
- Structure preserving reductions among convex optimization problems
- The Traveling Salesman Problem with Distances One and Two
- The maximum \(f\)-depth spanning tree problem
- \(z\)-approximations
Cited in
(7)- SOFSEM 2005: Theory and Practice of Computer Science
- The approximability of the weighted Hamiltonian path completion problem on a tree
- Exponential approximation schemata for some network design problems
- On the stability of approximation for Hamiltonian path problems
- scientific article; zbMATH DE number 1445365 (Why is no real title available?)
- An approximation algorithm for finding long paths in Hamiltonian graphs
- Approximation algorithms for some vehicle routing problems
This page was built for publication: Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706963)
