Randomized path coloring on binary trees.

DOI10.1016/S0304-3975(01)00310-3MaRDI QIDQ1853533zbMATH OpenFDO

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

Publication date 21 January 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(01)00310-3

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 1670530
• scientific article; zbMATH DE number 2080907
• Approximation Algorithms for Path Coloring in Trees
• STACS 2004
• Approximation and Online Algorithms

Cites work

• scientific article; zbMATH DE number 437558 (Why is no real title available?)
• scientific article; zbMATH DE number 1306887 (Why is no real title available?)
• scientific article; zbMATH DE number 1107733 (Why is no real title available?)
• scientific article; zbMATH DE number 1182769 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 6472619 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Constrained bipartite edge coloring with applications to wavelength routing
• Efficient routing in all-optical networks
• Efficient wavelength routing on directed fiber trees
• Probability Inequalities for Sums of Bounded Random Variables
• Tail bounds for occupancy and the satisfiability threshold conjecture
• Weighted sums of certain dependent random variables

Cited in

(6)

• scientific article; zbMATH DE number 1787232 (Why is no real title available?)
• scientific article; zbMATH DE number 1670530 (Why is no real title available?)
• Path problems in generalized stars, complete graphs, and brick wall graphs
• The permutation-path coloring problem on trees.
• Approximation Algorithms for Path Coloring in Trees
• Approximation and Online Algorithms

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 Q1853533)