A 2-approximation algorithm for the network substitution problem

A 2-approximation algorithm for the network substitution problem

0.00 Avg rating0 Votes
Article ID: iaor20061812
Country: Netherlands
Volume: 34
Issue: 1
Start Page Number: 94
End Page Number: 96
Publication Date: Jan 2006
Journal: Operations Research Letters
Authors:
Abstract:

The network substitution problem is to substitute an existing network for a new network so as to minimize the cost of exploiting the existing network during the period when the new network is being constructed. We show that this problem is NP-hard, and propose a 2-approximation algorithm for solving it.

Reviews

Required fields are marked *. Your email address will not be published.