scientific article; zbMATH DE number 1875429

zbMath1007.05089MaRDI QIDQ4796188

Bodo Siebert, Markus Bläser

Publication date: 2 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610368

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (7)

An overview of graph covering and partitioning ⋮ Approximability of the minimum-weight \(k\)-size cycle cover problem ⋮ Minimum-Weight Cycle Covers and Their Approximability ⋮ Maximum ATSP with weights zero and one via half-edges ⋮ TSP with bounded metrics ⋮ Minimum-weight cycle covers and their approximability ⋮ Restricted cycle factors and arc-decompositions of digraphs

This page was built for publication: