{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,17]],"date-time":"2023-11-17T14:48:53Z","timestamp":1700232533122},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0167-6377(92)90102-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"173-178","source":"Crossref","is-referenced-by-count":1,"title":["An algorithm for min-cost edge-disjoint cycles and its applications"],"prefix":"10.1016","volume":"12","author":[{"given":"Sun","family":"Wu","sequence":"first","affiliation":[]},{"given":"Udi","family":"Manber","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90102-9_BIB1","series-title":"Report 87454-OR","article-title":"Planar multicommodity flows, max cut and the chinese postman problem","author":"Barahona","year":"1987"},{"key":"10.1016\/0167-6377(92)90102-9_BIB2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TCS.1983.1085357","article-title":"A graph theoretic via minimization algorithm for two layer printed circuit board","volume":"30","author":"Chen","year":"1983","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0167-6377(92)90102-9_BIB3","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90102-9_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0167-6377(92)90102-9_BIB5","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0215009","article-title":"An O(EV log V) algorithm for finding a maximal weighted matching in general graphs","volume":"15","author":"Galil","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(92)90102-9_BIB6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230210105","article-title":"Shortest path algorithms using dynamic breadth-first search","volume":"21","author":"Goldfarb","year":"1991","journal-title":"Networks"},{"key":"10.1016\/0167-6377(92)90102-9_BIB7","series-title":"Progress in Graph Theory","first-page":"323","article-title":"The maximum weighted cycle-packing problem and its relation to the chinese postman problem","author":"Guan","year":"1984"},{"key":"10.1016\/0167-6377(92)90102-9_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(92)90102-9_BIB9","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/0167-6377(92)90102-9_BIB10","series-title":"Complexity of Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0167-6377(92)90102-9_BIB11","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(92)90102-9_BIB12","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1137\/0215034","article-title":"Planar multicommodity flows, maximum matching and negative cycles","volume":"15","author":"Matsumoto","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(92)90102-9_BIB13","first-page":"502","article-title":"Finding the maximum cut in a graph","volume":"10","author":"Orlova","year":"1972","journal-title":"Engrg. Cybernetics"},{"key":"10.1016\/0167-6377(92)90102-9_BIB14","first-page":"123","article-title":"Optimal layer assignment for interconnect","volume":"1","author":"Pinter","year":"1984","journal-title":"J. VLSI Computer System"},{"key":"10.1016\/0167-6377(92)90102-9_BIB15","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/12.53581","article-title":"Unifying maximum cut and minimum cut of a planar graph","volume":"39","author":"Shih","year":"1990","journal-title":"IEEE Trans. Computers"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792901029?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792901029?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:50:45Z","timestamp":1552902645000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792901029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["0167637792901029"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90102-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}