{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:04:13Z","timestamp":1774415053658,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003,1]]},"DOI":"10.1016\/s0167-6377(02)00184-0","type":"journal-article","created":{"date-parts":[[2002,12,3]],"date-time":"2002-12-03T06:41:48Z","timestamp":1038897708000},"page":"21-27","source":"Crossref","is-referenced-by-count":11,"title":["A greedy algorithm for multicut and integral multiflow in rooted trees"],"prefix":"10.1016","volume":"31","author":[{"given":"Marie-Christine","family":"Costa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"L\u00e9tocart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00184-0_BIB1","unstructured":"P. Camion, Matrices totalement unimodulaires et probl\u00e8mes combinatoires, Th\u00e8se et Rapport Euratom, Universit\u00e9 de Bruxelles, 1963."},{"key":"10.1016\/S0167-6377(02)00184-0_BIB2","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/S0097539792225297","article-title":"The complexity of multiterminal cuts","volume":"23","author":"Dalhaus","year":"1994","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0167-6377(02)00184-0_BIB3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1137\/S0097539793243016","article-title":"Approximate max-flow min-(multi)cut theorems and their applications","volume":"25","author":"Garg","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(02)00184-0_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02523685","article-title":"Primal-dual approximation algorithms for integral flow and multicut in trees","volume":"18","author":"Garg","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(02)00184-0_BIB5","series-title":"Paths, Flows and VLSI-Layout","first-page":"329","article-title":"Network flow algorithms","volume":"Vol. 9","author":"Goldberg","year":"1990"},{"issue":"2","key":"10.1016\/S0167-6377(02)00184-0_BIB6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1287\/opre.41.2.338","article-title":"A faster strongly polynomial minimum cost flow algorithm","volume":"41","author":"Orlin","year":"1993","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00184-0_BIB7","series-title":"Approximation Algorithms for NP-Hard Problems","first-page":"192","article-title":"Cut problems and their application to divide-and-conquer","author":"Shmoys","year":"1997"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001840?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001840?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T06:52:56Z","timestamp":1554187976000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0167637702001840"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00184-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}