The following pages link to (Q4250415):
Displaying 10 items.
- Parameterized maximum path coloring (Q392021) (← links)
- Maximizing profits of routing in WDM networks (Q813327) (← links)
- 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings (Q976131) (← links)
- Multicuts and integral multiflows in rings (Q1041998) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- Competitive algorithms and lower bounds for online randomized call control in cellular networks (Q3548724) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
