Algorithms and Computation
From MaRDI portal
Publication:5191642
DOI10.1007/b94771zbMath1205.68518OpenAlexW1769833081MaRDI QIDQ5191642
Kohei Okada, Hiroshi Nagamochi
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94771
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (11)
An overview of graph covering and partitioning ⋮ Approximating the minmax rooted-tree cover in a tree ⋮ Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems ⋮ Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ Unnamed Item ⋮ Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover ⋮ Approximation hardness of min-max tree covers ⋮ Minmax subtree cover problem on cacti ⋮ Minmax Tree Cover in the Euclidean Space
This page was built for publication: Algorithms and Computation
