{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T13:35:55Z","timestamp":1768743355773,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0166-218x(02)00465-1","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T11:09:00Z","timestamp":1062587340000},"page":"421-432","source":"Crossref","is-referenced-by-count":7,"title":["On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks"],"prefix":"10.1016","volume":"131","author":[{"given":"Tibor","family":"Jord\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0166-218X(02)00465-1_BIB1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1009889023408","article-title":"On shortest k-edge-connected Steiner networks in metric spaces","volume":"4","author":"Du","year":"2000","journal-title":"J. Combin. Optim."},{"key":"10.1016\/S0166-218X(02)00465-1_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","article-title":"A proof of Gilbert\u2013Pollak's conjecture on the Steiner ratio","volume":"7","author":"Du","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(02)00465-1_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0,1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/S0166-218X(02)00465-1_BIB4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s003730070012","article-title":"On minimum-weight k-edge connected Steiner networks on metric spaces","volume":"16","author":"Hsu","year":"2000","journal-title":"Graphs Combin."},{"issue":"4","key":"10.1016\/S0166-218X(02)00465-1_BIB5","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1137\/0219044","article-title":"Shortest circuit covers and postman tours in graphs with a nowhere zero 4-flow","volume":"19","author":"Jackson","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00465-1_BIB6","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/S0166-218X(02)00465-1_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge-connectivity in graphs, Advances in graph theory","volume":"3","author":"Mader","year":"1978","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"10.1016\/S0166-218X(02)00465-1_BIB8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0095-8956(78)80012-4","article-title":"\u00dcber n-fach zusammenh\u00e4ngende Eckenmengen in Graphen","volume":"25","author":"Mader","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(02)00465-1_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585735","article-title":"Minimum-weight two-connected spanning networks","volume":"46","author":"Monma","year":"1990","journal-title":"Math. Programming"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004651?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004651?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T06:55:09Z","timestamp":1551077709000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0166218X02004651"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00465-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}