On Approximating Restricted Cycle Covers
From MaRDI portal
Publication:3614154
DOI10.1137/060676003zbMath1165.05028arXivcs/0504038OpenAlexW1593801765MaRDI QIDQ3614154
Publication date: 16 March 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0504038
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
An overview of graph covering and partitioning ⋮ Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality ⋮ Approximability of the minimum-weight \(k\)-size cycle cover problem ⋮ Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem ⋮ Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles ⋮ Minimum-weight cycle covers and their approximability
This page was built for publication: On Approximating Restricted Cycle Covers
