The following pages link to STACS 2004 (Q5309705):
Displaying 16 items.
- Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks (Q511728) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- Optimal on-line colorings for minimizing the number of ADMs in optical networks (Q972358) (← links)
- Routing and path multicoloring (Q1607124) (← links)
- Randomized path coloring on binary trees. (Q1853533) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- (Q2934675) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- (Q3105838) (← links)
- (Q4471379) (← links)
- Approximation algorithms for constructing wavelength routing networks (Q4785217) (← links)
- Automata, Languages and Programming (Q5466456) (← links)
- Algorithms - ESA 2003 (Q5897231) (← links)
- An approximation algorithm for circular arc colouring (Q5945920) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)