Computer Science – Computational Complexity
Scientific paper
1998-09-24
J. Algorithms, 28, 142-171, (1998)
Computer Science
Computational Complexity
24 pages 1 figure
Scientific paper
We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under different cost functions), with a budget specified on the first, find a
Hunt III Harry B.
Marathe Madhav V.
Ravi R.
Ravi Srivaths
Rosenkrantz Daniel J.
No associations
LandOfFree
Bicriteria Network Design Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bicriteria Network Design Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bicriteria Network Design Problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-708966