Automata, Languages and Programming
From MaRDI portal
Publication:5466515
DOI10.1007/b99859zbMath1099.68079OpenAlexW2505584480MaRDI QIDQ5466515
Balaji Raghavachari, Raja Jothi
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Survivable network design: the capacitated minimum spanning network problem ⋮ Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem ⋮ Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Approximating capacitated tree-routings in networks ⋮ An improved approximation algorithm for capacitated multicast routings in networks ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
