{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:07:39Z","timestamp":1762099659276,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,12,1]],"date-time":"2001-12-01T00:00:00Z","timestamp":1007164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,12]]},"DOI":"10.1016\/s0020-0190(01)00183-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:47:08Z","timestamp":1027601228000},"page":"287-293","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":30,"title":["Minimum cost source location problem with vertex-connectivity requirements in digraphs"],"prefix":"10.1016","volume":"80","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimasa","family":"Ishii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00183-1_BIB001","first-page":"300","article-title":"Locating sources to meet flow demands in undirected networks","volume":"1851","author":"Arata","year":"2000"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB002","series-title":"Combinatorial Structures and Their Applications","first-page":"69","article-title":"Matroids, submodular functions, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB003","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00183-1_BIB004","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","article-title":"A weighted matroid intersection algorithm","volume":"2","author":"Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB005","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/jgt.3190170302","article-title":"On sparse subgraphs preserving connectivity properties","volume":"17","author":"Frank","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB006","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1006\/jagm.1999.1055","article-title":"Computing vertex connectivity: New bounds from old techniques","volume":"34","author":"Henzinger","year":"2000","journal-title":"J. Algorithms"},{"issue":"8","key":"10.1016\/S0020-0190(01)00183-1_BIB007","first-page":"9","article-title":"An algorithm for finding a node-subset having high connectivity from other nodes","volume":"99","author":"Honami","year":"1999","journal-title":"IPSJ SIG Notes, AL-66"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB008","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<157::AID-NET2>3.0.CO;2-E","article-title":"Edge connectivity between nodes and node-subsets","volume":"31","author":"Ito","year":"1998","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0020-0190(01)00183-1_BIB009","first-page":"704","article-title":"A faster and flexible algorithm for a location problem on undirected flow networks","volume":"E83-A","author":"Ito","year":"2000","journal-title":"IEICE Trans."},{"key":"10.1016\/S0020-0190(01)00183-1_BIB010","first-page":"338","article-title":"Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets","volume":"1969","author":"Ito","year":"2000"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB011","first-page":"551","article-title":"Location on networks","volume":"8","author":"Labbe","year":"1995"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB012","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01681329","article-title":"Matroid intersection algorithms","volume":"9","author":"Lawler","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB013","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","article-title":"A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph","volume":"7","author":"Nagamochi","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00183-1_BIB014","first-page":"1989","article-title":"Location problems on undirected flow networks","volume":"E73","author":"Tamura","year":"1990","journal-title":"IEICE Trans."},{"key":"10.1016\/S0020-0190(01)00183-1_BIB015","first-page":"863","article-title":"Plural cover problem on undirected flow networks","volume":"J81-A","author":"Tamura","year":"1998","journal-title":"IEICE Trans. A"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001831?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001001831?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T03:00:23Z","timestamp":1758078023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001001831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S0020019001001831"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00183-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2001,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimum cost source location problem with vertex-connectivity requirements in digraphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(01)00183-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}