{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:30Z","timestamp":1751342850615,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1021994406231","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T23:56:29Z","timestamp":1048290989000},"page":"45-68","source":"Crossref","is-referenced-by-count":1,"title":["Fast On-Line\/Off-Line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition"],"prefix":"10.1007","volume":"7","author":[{"given":"Sachin B.","family":"Patkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5113640_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(92)90045-5","volume":"12","author":"F. Barahona","year":"1992","unstructured":"F. Barahona, \u201cSeparating from the dominant of spanning tree polytope,\u201d Oper. Res. Letters, vol. 12, pp. 201-203, 1992.","journal-title":"Oper. Res. Letters"},{"key":"5113640_CR2","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(94)90013-2","volume":"49","author":"E. Cheng","year":"1994","unstructured":"E. Cheng and W. Cunningham, \u201cA faster algorithm for computing the strength of a network,\u201d Information Processing Letters, vol. 49, pp. 209-212, 1994.","journal-title":"Information Processing Letters"},{"issue":"3","key":"5113640_CR3","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"W. Cunningham","year":"1985","unstructured":"W. Cunningham, \u201cOptimal attack and reinforcement of a network,\u201d JACM, vol. 32, no. 3, pp. 549-561, 1985.","journal-title":"JACM"},{"key":"5113640_CR4","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W. Dinkelbach","year":"1967","unstructured":"W. Dinkelbach, \u201cOn nonlinear fractional programming,\u201d Management Sci., vol. 13, pp. 492-498, 1967.","journal-title":"Management Sci."},{"key":"5113640_CR5","unstructured":"J. Edmonds, \u201cSubmodular functions, matroids and certain polyhedra,\u201d in Proc. Calgary Intl. Conference on Combinatorial Structures, 1970, pp. 69-87."},{"key":"5113640_CR6","volume-title":"Submodular Functions and Optimization","author":"S. Fujishige","year":"1991","unstructured":"S. Fujishige, Submodular Functions and Optimization, Annals of Discrete Mathematics, North Holland, 1991."},{"key":"5113640_CR7","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0012-365X(00)00164-3","volume":"226","author":"S. Fujishige","year":"2001","unstructured":"S. Fujishige and S.B. Patkar, \u201cRealization of set functions as cut functions on graphs and hypergraphs,\u201d Discrete Mathematics, vol. 226, pp. 199-210, 2001.","journal-title":"Discrete Mathematics"},{"key":"5113640_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1006\/jagm.1997.0904","volume":"26","author":"H.N. Gabow","year":"1998","unstructured":"H.N. Gabow, \u201cAlgorithms for graphic polymatroids and parametric s-sets,\u201d J. Algorithms, vol. 26, pp. 48-86, 1998.","journal-title":"J. Algorithms"},{"key":"5113640_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"G. Gallo, M. Grigoriadis, and R.E. Tarjan, \u201cA fast parametric network flow algorithm,\u201d SIAM J. Computing, vol. 18, pp. 30-55, 1989.","journal-title":"SIAM J. Computing"},{"key":"5113640_CR10","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0220040","volume":"20","author":"D. Gusfield","year":"1991","unstructured":"D. Gusfield, \u201cComputing the strength of a graph,\u201d SIAM J. Computing, vol. 20, pp. 639-654, 1991.","journal-title":"SIAM J. Computing"},{"key":"5113640_CR11","first-page":"186","volume":"26","author":"H. Imai","year":"1983","unstructured":"H. Imai, \u201cNetwork flow algorithms for lower truncated transversal polymatroids,\u201d J. Op. Research Society Japan, vol. 26, pp. 186-210, 1983.","journal-title":"J. Op. Research Society Japan"},{"issue":"1","key":"5113640_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/00207728108963728","volume":"12","author":"M. Iri","year":"1981","unstructured":"M. Iri and S. Fujishige, \u201cUse of matroid theory in operations research, circuits and systems theory,\u201d Int. J. Systems Sci., vol. 12, no. 1, pp. 27-54, 1981.","journal-title":"Int. J. Systems Sci."},{"key":"5113640_CR13","doi-asserted-by":"crossref","unstructured":"A. Itai and M. Rodeh, \u201cThe multi-tree approach to reliability in distributed networks,\u201d in Proc. 25th Ann. Symp. FOCS, 1984, pp. 137-147.","DOI":"10.1109\/SFCS.1984.715910"},{"key":"5113640_CR14","unstructured":"H. Narayanan, \u201cTheory of matroids and network analysis,\u201d Ph.D. Thesis, Department of Electrical Engineering, I.I.T. Bombay, 1974."},{"key":"5113640_CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0024-3795(91)90070-D","volume":"144","author":"H. Narayanan","year":"1991","unstructured":"H. Narayanan, \u201cThe principal lattice of partitions of a submodular function,\u201d Linear Algebra and its Applications, vol. 144, pp. 179-216, 1991.","journal-title":"Linear Algebra and its Applications"},{"key":"5113640_CR16","doi-asserted-by":"crossref","unstructured":"H. Narayanan, Submodular Functions and Electrical Networks, Annals of Discrete Mathematics-54, North Holland, 1997.","DOI":"10.1016\/S0167-5060(08)70678-2"},{"key":"5113640_CR17","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1006\/jagm.1996.0047","volume":"21","author":"H. Narayanan","year":"1996","unstructured":"H. Narayanan, S. Roy, and S.B. Patkar, \u201cApproximation Algorithms for min-k-overlap problems, using the principal lattice of partitions approach,\u201d J. Algorithms, vol. 21, pp. 306-330, 1996.","journal-title":"J. Algorithms"},{"key":"5113640_CR18","unstructured":"S.B. Patkar, \u201cMin-cost edge-weight augmentation to make a graph uniformly-dense,\u201d Technical Report, Dept.Mathematics, IIT Bombay, 2000."},{"key":"5113640_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/3-540-56279-6_56","volume-title":"Proc. of the 3rd Ann. Int. Symp. on Algorithms and Computation, (ISAAC), Japan","author":"S.B. Patkar","year":"1992","unstructured":"S.B. Patkar and H. Narayanan, \u201cPrincipal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity,\u201d in Proc. of the 3rd Ann. Int. Symp. on Algorithms and Computation, (ISAAC), Japan, 1992, Lecture Notes in Computer Science, vol. 650, Springer: Berlin, pp. 41-50."},{"key":"5113640_CR20","first-page":"83","volume":"J59A","author":"N. Tomizawa","year":"1976","unstructured":"N. Tomizawa, \u201cStrongly irreducible matroids and principal partition of a matroid into strongly irreducible minors, Transactions of the Institute of Electronics and Communication Engineers of Japan, vol. J59A, pp. 83-91, 1976 (in Japanese).","journal-title":"Transactions of the Institute of Electronics and Communication Engineers of Japan"},{"key":"5113640_CR21","unstructured":"N. Tomizawa and S. Fujishige, \u201cHistorical survey of extensions of the concept of principal partition and their unifying generalization to hypermatroids,\u201d Systems Science Research Report No. 5, Department of Systems Science, Tokyo Institute of Technology, April 1982. Also its abridgment in Proceedings of the 1982 IEEE International Symposium on Circuits and Systems, Rome, 1982, pp. 142-145."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021994406231.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021994406231\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021994406231.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:14:25Z","timestamp":1751282065000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021994406231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5113640"],"URL":"https:\/\/doi.org\/10.1023\/a:1021994406231","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}