Minimum-weight cycle covers and their approximability (Q1028118): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095936434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating maximum weight cycle covers in directed graphs with weights zero and one / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the TSP with sharpened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between ATSP and the cycle cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for metric MaxTSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved deterministic approximation algorithms for max TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the \(k\)-customer vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to ``An approximation algorithm for maximum triangle packing'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricted Two-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating Restricted Cycle Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902513 / rank
 
Normal rank

Latest revision as of 18:06, 1 July 2024

scientific article
Language Label Description Also known as
English
Minimum-weight cycle covers and their approximability
scientific article

    Statements

    Minimum-weight cycle covers and their approximability (English)
    0 references
    0 references
    30 June 2009
    0 references
    0 references
    approximation algorithms
    0 references
    cycle covers
    0 references
    inapproximability
    0 references
    non-constructive algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references