A 2-approximation algorithm for the network substitution problem

Authors:
Nicolai N. Pisaruk
Affiliations:
Faculty of Applied Mathematics and Informatics, Belarus State University, F. Skarina Av. 4, 220088 Minsk, Belarus
Venue:
Operations Research Letters
Year:
2006

Citing 4
Cited 0

The boundaries of submodular functions

Computational Mathematics and Mathematical Physics
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

Discrete Applied Mathematics
A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The network substitution problem is to substitute an existing network for a new network so that 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.