{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T19:38:35Z","timestamp":1768592315856,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,6]]},"DOI":"10.1016\/s0020-0190(98)00070-2","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"291-297","source":"Crossref","is-referenced-by-count":16,"title":["On budget-constrained flow improvement"],"prefix":"10.1016","volume":"66","author":[{"given":"S.","family":"Schwarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00070-2_BIB1","series-title":"Networks Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB2","series-title":"Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'97)","article-title":"Augmenting undirected edge connectivity in \u00d5(n2) time","author":"Bencz\u00far","year":"1997"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB3","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","article-title":"Linear-time computation of optimal subgraphs of decomposable graphs","volume":"8","author":"Bern","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB4","series-title":"Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'96)","first-page":"539","article-title":"Increasing the weight of minimum spanning trees","author":"Frederickson","year":"1996"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB5","series-title":"Proceedings of the Third Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization","first-page":"57","article-title":"An efficient approximation algorithm for the survivable network design problem","author":"Gabow","year":"1993"},{"issue":"B","key":"10.1016\/S0020-0190(98)00070-2_BIB6","article-title":"An efficient approximation algorithm for the survivable network design problem","volume":"80","author":"Gabow","year":"1998","journal-title":"Math. Programming"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB7","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","article-title":"Minimum concave-cost network flow problems: Applications, complexity, and algorithms","volume":"25","author":"Guisewite","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0020-0190(98)00070-2_BIB9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1006\/jagm.1997.0856","article-title":"Edge weight reduction problems in directed acyclic graphs","volume":"24","author":"Hambrush","year":"1997","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/S0020-0190(98)00070-2_BIB10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/S0020-0190(98)00070-2_BIB11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/net.3230190304","article-title":"Analysis of a flow problem with fixed charges","volume":"19","author":"Hochbaum","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB12","series-title":"Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97)","first-page":"281","article-title":"Improving spanning trees by upgrading nodes","volume":"Vol. 1256","author":"Krumke","year":"1997"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB13","article-title":"Modifying networks to obtain low cost subgraphs","author":"Krumke","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00070-2_BIB14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.3230260105","article-title":"Network upgrading problems","volume":"26","author":"Paik","year":"1995","journal-title":"Networks"},{"key":"10.1016\/S0020-0190(98)00070-2_BIB15","series-title":"Proc. 25th Annual ACM Symposium on the Theory of Computing (STOC'93)","first-page":"288","article-title":"The network inhibition problem","author":"Phillips","year":"1993"},{"issue":"2","key":"10.1016\/S0020-0190(98)00070-2_BIB16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0020-0190(98)00070-2_BIB17","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of pareto optima in multiple-objective shortest path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000702?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000702?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:44Z","timestamp":1556643284000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0020019098000702"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00070-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}