Parameterized Traveling Salesman Problem: Beating the Average
From MaRDI portal
Publication:5743554
DOI10.1137/140980946zbMath1329.05179arXiv1408.0531OpenAlexW2254574817MaRDI QIDQ5743554
Publication date: 5 February 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.0531
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
Parameterized algorithms and data reduction for the short secluded s‐t‐path problem ⋮ Detours in directed graphs ⋮ Going Far from Degeneracy ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Solving MAX-\(r\)-SAT above a tight lower bound
- Parameterizing above or below guaranteed values
- Geometric algorithms and combinatorial optimization
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
- A domination algorithm for {0,1}-instances of the travelling salesman problem
- Max-Cut Parameterized above the Edwards-Erdős Bound
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- Probability and Computing
- Parameterized Algorithms
- Maximum matching and a polyhedron with 0,1-vertices
- Some Extremal Properties of Bipartite Subgraphs
This page was built for publication: Parameterized Traveling Salesman Problem: Beating the Average
