Li Zhang
ABSTRACT
Upgrading arcs are often used in transportation and telecommunication systems. In a real world situation, upgrading an arc between a pair of nodes corresponds to using a rapid mode of transit, such as using a plane instead of a truck between a pair of cities in a transportation network or using a higher speed cable between a pair of servers in a telecommunication network. These upgrades decrease transportation times through the network and can be critical in achieving delivery deadlines. This paper introduces and analyzes the upgrading arc problem with budget constraint. We show that this problem is NP-Complete in general and present several polynomially solvable cases.
- Campbell, A. M., Lowe, T. J. and Zhang, L. Upgrading arcs to minimize the maximum travel time in a network. Working paper, 2004.]]Google Scholar
- Campbell, J. F., Ernst, A. and Krishnamoorthy, M. Facility location: applications and theory. Springer-Verlag, 2002.]]Google Scholar
- Campbell, J. F., Ernst, A. and Krishnamoorthy, M. Hub arc location problems: part 1 -- introduction and results. Submitted to Management Science, 2004.]] Google ScholarDigital Library
- Campbell, J. F., Ernst, A. and Krishnamoorthy, M. Hub arc location problems: part 2 -- formulations and optimal algorithms. Submitted to Management Science, 2004.]]Google Scholar
- Chan, P. K. Algorithms for library-specific sizing of combinatorial logic. In Proceedings of the 27th DAC Conference, 1990, 353--356.]] Google ScholarDigital Library
- Garey, M. R. and Johnson, D. S. Computer and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.]] Google ScholarDigital Library
- Iyer, A. V. and Ratliff, H. D. Accumulation point location on tree networks for guaranteed time distribution. Management Science, 1990, 36(8):958--969.]]Google ScholarDigital Library
- Kara, B. Y. and Tansel, B. C. On the single-assignment p-hub center problem. European Journal of Operational Research, 2000, 125(3):648--655.]]Google ScholarCross Ref
- McGreer, P., Brayton, R., Rudell, R. and Sangiovanni-Vincentelli, A. Extended stuck-fault testability for combinatorial networks. In Proceedings of the 6th MIT Conference on Advanced Research in VLSI, April 1990.]] Google ScholarDigital Library
- O'Kelly, M. E. and Miller, H. J. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 1987, 32:393--404.]]Google ScholarCross Ref
- O'Kelly, M. E. and Miller, H. J. Solution strategies for the single facility minimax hub location problem. Papers in Regional Science: The Journal of the RSAI, 1991, 70:367--380.]]Google ScholarCross Ref
- Paik, D. and Sahni, S. Network upgrading problems. Networks, 1995, 26:45--58.]]Google ScholarCross Ref
- Zhang, L. The p-hub center allocation problem and the q-upgrading arc problem. Ph.D. thesis, The University of Iowa, Iowa, 2004.]]Google Scholar
- Upgrading arc problem with budget constraint
Recommendations
Complexities of some interesting problems on spanning trees
This paper deals with the complexity issues of some new interesting spanning tree problems. Here we define some new spanning tree problems by imposing various constraints and restrictions on graph parameters and present relevant results. Also we ...
Limits of minimum circuit size problem as oracle
CCC '16: Proceedings of the 31st Conference on Computational ComplexityThe Minimum Circuit Size Problem (MCSP) is known to be hard for statistical zero knowledge via a BPP-Turing reduction (Allender and Das, 2014), whereas establishing NP-hardness of MCSP via a polynomial-time many-one reduction is difficult (Murray and ...
On the (non) NP-hardness of computing circuit complexity
CCC '15: Proceedings of the 30th Conference on Computational ComplexityThe Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k? This is the definitive problem of circuit synthesis, and it has been studied since the 1950s. ...
Comments