Approximation and Online Algorithms
From MaRDI portal
Publication:5898480
DOI10.1007/11671411zbMath1177.90397OpenAlexW4210634114MaRDI 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
Programming involving graphs or networks (90C35) Paths and cycles (05C38) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (2)
An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles ⋮ Minimum-Weight Cycle Covers and Their Approximability
This page was built for publication: Approximation and Online Algorithms