Bicriteria network design problems

DOI10.1006/JAGM.1998.0930MaRDI QIDQ6829459zbMATH OpenFDO

Authors Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, H. B. III Hunt

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://figshare.com/articles/journal_contribution/Bicriteria_Network_Design_Problems/6704135

zbMATH Keywords

bicriteria network design problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cited in

(5)

• Broadcasting and three list subtraction
• Approximation algorithms for directed weighted spanners
• Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
• Biased random-key genetic algorithms for the minimum subgraph diameter problem
• Directed buy-at-bulk spanners

This page was built for publication: Bicriteria network design problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829459)