{"id":"https://openalex.org/W1980257116","doi":"https://doi.org/10.1137/s0895480100368189","title":"Reserving Resilient Capacity in a Network","display_name":"Reserving Resilient Capacity in a Network","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W1980257116","doi":"https://doi.org/10.1137/s0895480100368189","mag":"1980257116"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480100368189","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480100368189","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039259953","display_name":"Graham Brightwell","orcid":"https://orcid.org/0000-0001-5955-3628"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Brightwell","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009089187","display_name":"Gianpaolo Oriolo","orcid":"https://orcid.org/0000-0003-2028-7005"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Oriolo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044801840","display_name":"F. Bruce Shepherd","orcid":"https://orcid.org/0000-0003-1972-1396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. B. Shepherd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8876,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.72841261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"4","first_page":"524","last_page":"539"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7053602337837219},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.702643632888794},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.6355260014533997},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5709264278411865},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.554636538028717},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5445280075073242},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5050740838050842},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49078163504600525},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.47346511483192444},{"id":"https://openalex.org/keywords/reservation","display_name":"Reservation","score":0.4521867632865906},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43070030212402344},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42735356092453003},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32444941997528076},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23348048329353333},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06896045804023743}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7053602337837219},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.702643632888794},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.6355260014533997},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5709264278411865},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.554636538028717},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5445280075073242},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5050740838050842},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49078163504600525},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.47346511483192444},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.4521867632865906},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43070030212402344},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42735356092453003},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32444941997528076},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23348048329353333},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06896045804023743},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480100368189","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480100368189","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:researchonline.lse.ac.uk:7475","is_oa":false,"landing_page_url":"https://orcid.org/0000-0001-5955-3628>,","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:art.torvergata.it:2108/49710","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/49710","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:eprints.lse.ac.uk:7475","is_oa":false,"landing_page_url":"http://eprints.lse.ac.uk/7475/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W189107550","https://openalex.org/W1483602020","https://openalex.org/W1502321571","https://openalex.org/W1518511602","https://openalex.org/W1538760979","https://openalex.org/W1541536235","https://openalex.org/W1977545325","https://openalex.org/W1993734840","https://openalex.org/W2010440802","https://openalex.org/W2011160417","https://openalex.org/W2014814924","https://openalex.org/W2034397200","https://openalex.org/W2051290577","https://openalex.org/W2070045881","https://openalex.org/W2112932187","https://openalex.org/W2116038949","https://openalex.org/W2119874970","https://openalex.org/W2131326154","https://openalex.org/W2142695913","https://openalex.org/W2569646339","https://openalex.org/W4245185315","https://openalex.org/W4248998285","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3161514703","https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2051329268","https://openalex.org/W1994440468","https://openalex.org/W3006069386"],"abstract_inverted_index":{"We":[0,104],"examine":[1],"various":[2],"problems":[3],"concerning":[4],"the":[5,45,52,60,63,107,110,142,149,164],"reservation":[6,111],"of":[7,36,47,51,62,70,115,118],"capacity":[8,58,100],"in":[9,59,78,141,163],"a":[10,17,32,116,124,130,158],"given":[11,33],"network,":[12,53],"where":[13,109],"each":[14,102],"arc":[15,29],"has":[16,112],"per-unit":[18],"cost,":[19],"so":[20],"as":[21],"to":[22,65,96,113,128],"be":[23,76],"\"resilient\"":[24],"against":[25],"one":[26],"or":[27],"more":[28],"failures.":[30],"For":[31],"pair":[34],"(s,t)":[35,68],"nodes":[37],"and":[38,167],"demand":[39],"T,":[40],"we":[41,86,93,122,154],"require":[42],"that,":[43],"on":[44,101,106,136],"failure":[46],"any":[48,82],"k":[49],"arcs":[50],"there":[54],"is":[55,90,152,172],"sufficient":[56],"reserved":[57],"remainder":[61],"network":[64,146],"support":[66],"an":[67,98],"flow":[69,147],"value":[71],"T.":[72],"This":[73],"problem":[74],"can":[75],"solved":[77],"polynomial":[79,159],"time":[80,160],"for":[81],"fixed":[83],"k,":[84],"but":[85],"show":[87,168],"that":[88,169],"it":[89],"NP-hard":[91],"if":[92],"are":[94],"required":[95],"reserve":[97],"integer":[99],"arc.":[103],"concentrate":[105],"case":[108,165],"consist":[114],"collection":[117],"arc-disjoint":[119],"paths:":[120],"here":[121],"give":[123,157],"very":[125],"simple":[126],"algorithm":[127,162],"find":[129],"minimum":[131],"cost":[132],"fractional":[133],"solution,":[134],"based":[135],"finding":[137],"successive":[138],"shortest":[139],"paths":[140],"network.":[143],"Unlike":[144],"traditional":[145],"problems,":[148],"integral":[150],"version":[151],"NP-hard:":[153],"do,":[155],"however,":[156],"$\\frac{15}{14}$-approximation":[161],"k=1":[166],"this":[170],"bound":[171],"best":[173],"possible":[174],"unless":[175],"P":[176],"=":[177],"NP.":[178]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}