S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, and S. S. Ravi, Approximation algorithms for certain network improvement problems. J. Comb. Optim. 2, 1998, 257-288. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Weight Reduction Problems with Bottleneck Objective - Burkard, Lin, Zhang (2001) (1 citation) (Correct)
....the capacity of a network subject to budget constraints. Later, Fulkerson and Harding [8] maximized the shortest s t path subject to a budget constraint. With respect to spanning trees similar studies were performed by Frederickson and Solis Oba [6] Krumke, Marathe, Noltemeier, Ravi and Ravi [10] as well The rst author acknowledges nancial support by the Spezialforschungsbereich F 003 Optimierung und Kontrolle , Projektbereich Diskrete Optimierung. The second and third authors acknowledge partial support of Hong Kong University Grant Council under the grant CITYU 9040651. ....
S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, and S. S. Ravi, Approximation algorithms for certain network improvement problems. J. Comb. Optim. 2, 1998, 257-288.
Inverse Optimization: A Survey on Problems, Methods, and Results - Heuberger (Correct)
....it in detail. We only note that there is a broad literature in this eld, which includes the shortest path problem (see for instance Fulkerson and Harding [55] the minimum spanning tree problem (see for instance Frederickson and Solis Oba [54, 53] Krumke, Marathe, Noltemeier, Ravi, and Ravi [60], Drangmeister, Krumke, Marathe, Noltemeier, Ravi [48] maximum ow problems (see for instance Phillips [64] bottleneck capacity expansion problems (see Yang and Zhang [69] Zhang, Yang, and Lin [70] and Burkard, Klinz, and Zhang [46] and weight reduction problems (see Burkard, Lin, and ....
S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, and S. S. Ravi, Approximation algorithms for certain network improvement problems, J. Comb. Optim. 2 (1998), 257-288.
Bottleneck Capacity Expansion Problems With General Budget .. - Burkard, Klinz, Zhang (2000) (Correct)
....new capacities (weights) which turns most of them into NP hard problems. See e.g. Philipps [12] for the maximum ow minimum cut case and Drangmeister, Krumke, Marathe, Noltemeier and S.S. Ravi [5] for the minimum spanning tree case. The paper by Krumke, Marathe, Noltemeier, R. Ravi and S.S. Ravi [9] is worth to be mentioned here since it considers multi criteria budget constraints (such constraints can be formulated within the framework of our algebraic model) 2.4 Parametric reformulation of the bottleneck capacity expansion problem Let F be an optimal solution of the bottleneck ....
S.O. Krumke, M.V. Marathe, H. Noltemeier, R. Ravi and S.S. Ravi, Approximation algorithms for certain network improvement problems, Journal of Combinatorial Optimization 2, 1998, 257-288.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC