scientific article; zbMATH DE number 1303779
From MaRDI portal
Publication:4250415
zbMath0926.90013MaRDI QIDQ4250415
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18)
Related Items (10)
Parameterized Maximum Path Coloring ⋮ Approximation algorithms for maximum weight k-coverings of graphs by packings ⋮ Parameterized maximum path coloring ⋮ Maximum max-k-clique subgraphs in cactus subtree graphs ⋮ Competitive algorithms and lower bounds for online randomized call control in cellular networks ⋮ Path problems in generalized stars, complete graphs, and brick wall graphs ⋮ 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings ⋮ Inapproximability and approximability of maximal tree routing and coloring ⋮ Multicuts and integral multiflows in rings ⋮ Maximizing profits of routing in WDM networks
This page was built for publication:
