Pages that link to "Item:Q5941061"

The following pages link to The complexity of path coloring and call scheduling (Q5941061):

Displaying 26 items.

• On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
• Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem (Q295887) (← links)
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• Parameterized maximum path coloring (Q392021) (← links)
• A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
• Short length Menger's theorem and reliable optical routing (Q557907) (← links)
• Multiflows in symmetric digraphs (Q713317) (← links)
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
• Routing and wavelength assignment by partition colouring (Q819072) (← links)
• Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
• Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
• Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
• Nash equilibria in all-optical networks (Q1043952) (← links)
• Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
• Path multicoloring in spider graphs with even color multiplicity (Q1705690) (← 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)
• Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
• Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
• On some applications of the selective graph coloring problem (Q2629634) (← links)
• A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
• Parameterized Maximum Path Coloring (Q2891353) (← links)
• Lagrangean decomposition/relaxation for the routing and wavelength assignment problem (Q2892159) (← links)
• Wavelength assignment in multifiber star networks (Q3057165) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
• Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)