STACS 2004

DOI10.1007/B96012MaRDI QIDQ5309705zbMATH OpenOpenAlexFDO

Authors I. Caragiannis, C. Kaklamanis

Publication date 1 October 2007

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

Full work available at URL https://doi.org/10.1007/b96012

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximation Algorithms for Path Coloring in Trees
• scientific article; zbMATH DE number 1754632
• Routing and path multicoloring
• scientific article; zbMATH DE number 1984545
• scientific article; zbMATH DE number 2040950

Cited in

(29)

• Routing and path multicoloring
• Randomized path coloring on binary trees.
• A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
• Path multicoloring with fewer colors in spiders and caterpillars
• scientific article; zbMATH DE number 1670530 (Why is no real title available?)
• Parameterized maximum path coloring
• scientific article; zbMATH DE number 6381717 (Why is no real title available?)
• Wavelength assignment in multifiber star networks
• scientific article; zbMATH DE number 5990404 (Why is no real title available?)
• Routing with Maximum EDPs and Wavelength Assignment with Path Conflict Graphs
• scientific article; zbMATH DE number 1182769 (Why is no real title available?)
• scientific article; zbMATH DE number 1984545 (Why is no real title available?)
• scientific article; zbMATH DE number 2040950 (Why is no real title available?)
• scientific article; zbMATH DE number 2079419 (Why is no real title available?)
• scientific article; zbMATH DE number 1754632 (Why is no real title available?)
• Approximation algorithms for constructing wavelength routing networks
• scientific article; zbMATH DE number 2091968 (Why is no real title available?)
• Inapproximability results for wavelength assignment in WDM optical networks
• Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
• Approximation Algorithms for Path Coloring in Trees
• Automata, Languages and Programming
• Line system design and a generalized coloring problem
• Wavelength management in WDM rings to maximize the number of connections
• Wavelength Management in WDM Rings to Maximize the Number of Connections
• The complexity of path coloring and call scheduling
• An approximation algorithm for circular arc colouring
• Fractional path coloring in bounded degree trees with applications
• Maximizing profits of routing in WDM networks
• Optimal on-line colorings for minimizing the number of ADMs in optical networks

This page was built for publication: STACS 2004

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