Approximation and Online Algorithms
From MaRDI portal
Publication:5898480
DOI10.1007/11671411zbMath1177.90397MaRDI QIDQ5898480
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
90C35: Programming involving graphs or networks
05C38: Paths and cycles
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles, Minimum-Weight Cycle Covers and Their Approximability
