Minimum-weight cycle covers and their approximability
type: Item
instance of: scholarly article
title: Minimum-weight cycle covers and their approximability
zbMATH Open document ID: 1172.05344
author: Bodo Manthey
published in: Discrete Applied Mathematics
publication date: 2009-06-30T00:00:00Z
full work available at URL: minimumweight-cycle-covers-and-their-approximability(b9c53f78-fcd3-445c-8769-0d95f9e6907f).html
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 5571990
zbMATH Keywords: approximation algorithms
zbMATH Keywords: cycle covers
zbMATH Keywords: inapproximability
zbMATH Keywords: non-constructive algorithms
MaRDI profile type: Publication
OpenAlex ID: W2095936434
cites work: Q3056948
cites work: Q4258216
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: Approximating maximum weight cycle covers in directed graphs with weights zero and one
cites work: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
cites work: Algorithms and Data Structures
cites work: Q4796188
cites work: Linear approximation of shortest superstrings
cites work: Approximation algorithms for the TSP with sharpened triangle inequality
cites work: On the relationship between ATSP and the cycle cover problem
cites work: Improved approximation algorithms for metric MaxTSP
cites work: Improved deterministic approximation algorithms for max TSP
cites work: Nonconstructive tools for proving polynomial-time decidability
cites work: Q3768703
cites work: A General Approximation Technique for Constrained Forest Problems
cites work: An extension of matching theory
cites work: On the complexity of the \(k\)-customer vehicle routing problem
cites work: Erratum to ``An approximation algorithm for maximum triangle packing''
cites work: On Restricted Two-Factors
cites work: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
cites work: Matching theory
cites work: On Approximating Restricted Cycle Covers
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Q5704414
cites work: P-Complete Approximation Problems
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
cites work: Q3902513
DOI: 10.1016/J.DAM.2008.10.005
description: scientific article; zbMATH DE number 5571990