Bicriteria Network Design Problems
DOI10.1006/jagm.1998.0930zbMath0906.68076arXivcs/9809103MaRDI QIDQ4216149
S. S. Ravi, R. Ravi, Ravi Sundaram, Madhav V. Marathe, Harry B. III Hunt, Daniel J. Rosenkrantz
Publication date: 2 December 1998
Published in: Journal of Algorithms, Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/9809103
approximation algorithm; cost function; Steiner tree; input graph; bicriteria network design problems; span tree
90C35: Programming involving graphs or networks
68W40: Analysis of algorithms
90C29: Multi-objective and goal programming
68R10: Graph theory (including graph drawing) in computer science
90C59: Approximation methods and heuristics in mathematical programming
68W10: Parallel algorithms in computer science
68W25: Approximation algorithms