Approximation Algorithms for Path Coloring in Trees
From MaRDI portal
Publication:5450804
DOI10.1007/11671541_3zbMath1132.68818OpenAlexW178506315MaRDI QIDQ5450804
Giuseppe Persiano, Christos Kaklamanis, Ioannis Caragiannis
Publication date: 14 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671541_3
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ Fractional path coloring in bounded degree trees with applications
This page was built for publication: Approximation Algorithms for Path Coloring in Trees
