Open Access
Translator Disclaimer
2013 The Capacity Expansion Path Problem in Networks
Jianping Li, Juanping Zhu
J. Appl. Math. 2013: 1-4 (2013). DOI: 10.1155/2013/156901

Abstract

This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial algorithm for the GCEP problem, no matter the graph is acyclic or not. Furthermore, we investigate two special versions of the GCEP problem. For the minimum number arc capacity expansion path problem (MN-CEP), we give a strongly polynomial algorithm based on the dynamic programming. For the minimum-cost capacity expansion shortest path problem (MCESP), we give a strongly polynomial algorithm by constructing a shortest paths network.

Citation

Download Citation

Jianping Li. Juanping Zhu. "The Capacity Expansion Path Problem in Networks." J. Appl. Math. 2013 1 - 4, 2013. https://doi.org/10.1155/2013/156901

Information

Published: 2013
First available in Project Euclid: 14 March 2014

zbMATH: 1271.90017
MathSciNet: MR3082002
Digital Object Identifier: 10.1155/2013/156901

Rights: Copyright © 2013 Hindawi

JOURNAL ARTICLE
4 PAGES


SHARE
Vol.2013 • 2013
Back to Top