Randomized path coloring on binary trees

DOI10.1007/3-540-44436-X_8MaRDI QIDQ2753727zbMATH OpenFDO

Authors I. Caragiannis, C. Kaklamanis, P. Persiano, V. Auletta

Publication date 6 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44436-X_8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Randomized path coloring on binary trees.
• Approximation Algorithms for Path Coloring in Trees
• STACS 2004
• Approximation and Online Algorithms
• A memetic algorithm to schedule planned maintenance for the national grid

Cited in

(6)

• Randomized path coloring on binary trees.
• A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
• Random colorings of a Cayley tree
• Approximation Algorithms for Path Coloring in Trees
• Approximation and Online Algorithms
• Fractional path coloring in bounded degree trees with applications

This page was built for publication: Randomized path coloring on binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753727)