{"id":"https://openalex.org/W1984708302","doi":"https://doi.org/10.1109/rndm.2015.7325237","title":"Algorithms for finding robust and sustainable network flows against multilink-attack","display_name":"Algorithms for finding robust and sustainable network flows against multilink-attack","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W1984708302","doi":"https://doi.org/10.1109/rndm.2015.7325237","mag":"1984708302"},"language":"en","primary_location":{"id":"doi:10.1109/rndm.2015.7325237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rndm.2015.7325237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","raw_type":"proceedings-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/A5048185370","display_name":"Jean-Fran\u00e7ois Baffier","orcid":"https://orcid.org/0000-0002-8800-6356"},"institutions":[{"id":"https://openalex.org/I4210086780","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19","country_code":"JP","type":"government","lineage":["https://openalex.org/I4210086780"]},{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]},{"id":"https://openalex.org/I4387152154","display_name":"Japanese-French Laboratory for Informatics","ror":"https://ror.org/007xn7v02","country_code":null,"type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203951103","https://openalex.org/I39804081","https://openalex.org/I4387152154","https://openalex.org/I74801974"]},{"id":"https://openalex.org/I176979517","display_name":"International Research Center for Japanese Studies","ror":"https://ror.org/04861vz74","country_code":"JP","type":"education","lineage":["https://openalex.org/I1319490839","https://openalex.org/I176979517","https://openalex.org/I4210148627"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Jean-Francois Baffier","raw_affiliation_strings":["Department of Computer Science, The University of Tokyo","ERATO, JST","The Japanese-French Laboratory for Informatics, CNRS"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"ERATO, JST","institution_ids":["https://openalex.org/I4210086780"]},{"raw_affiliation_string":"The Japanese-French Laboratory for Informatics, CNRS","institution_ids":["https://openalex.org/I176979517","https://openalex.org/I4387152154"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038811120","display_name":"Vorapong Suppakitpaisarn","orcid":"https://orcid.org/0000-0002-7020-395X"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]},{"id":"https://openalex.org/I4210086780","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19","country_code":"JP","type":"government","lineage":["https://openalex.org/I4210086780"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Vorapong Suppakitpaisarn","raw_affiliation_strings":["Department of Computer Science, The University of Tokyo","ERATO, JST"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]},{"raw_affiliation_string":"ERATO, JST","institution_ids":["https://openalex.org/I4210086780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048185370"],"corresponding_institution_ids":["https://openalex.org/I176979517","https://openalex.org/I4210086780","https://openalex.org/I4387152154","https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":0.6656,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73709581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"251","last_page":"258"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9973000288009644,"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"}},"topics":[{"id":"https://openalex.org/T10400","display_name":"Network Security and Intrusion Detection","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9945999979972839,"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"}},{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7983263731002808},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6393939852714539},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5873218774795532},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5756520628929138},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.49384480714797974},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49058952927589417},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48869088292121887},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45854854583740234},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4361114203929901},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37059035897254944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2827935218811035}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7983263731002808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6393939852714539},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5873218774795532},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5756520628929138},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.49384480714797974},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49058952927589417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48869088292121887},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45854854583740234},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4361114203929901},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37059035897254944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2827935218811035},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rndm.2015.7325237","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rndm.2015.7325237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/12","score":0.41999998688697815,"display_name":"Responsible consumption and production"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W58570057","https://openalex.org/W150908699","https://openalex.org/W183428525","https://openalex.org/W1498924426","https://openalex.org/W1544421729","https://openalex.org/W1965641578","https://openalex.org/W1968540934","https://openalex.org/W1976969221","https://openalex.org/W1980381676","https://openalex.org/W1983383464","https://openalex.org/W1986538507","https://openalex.org/W2002531683","https://openalex.org/W2003930232","https://openalex.org/W2011838309","https://openalex.org/W2014377998","https://openalex.org/W2014774419","https://openalex.org/W2045483690","https://openalex.org/W2048285065","https://openalex.org/W2049571088","https://openalex.org/W2049776854","https://openalex.org/W2056433419","https://openalex.org/W2061721864","https://openalex.org/W2081956611","https://openalex.org/W2082707864","https://openalex.org/W2087581446","https://openalex.org/W2092890945","https://openalex.org/W2133182510","https://openalex.org/W2133494553","https://openalex.org/W2135291684","https://openalex.org/W2150626614","https://openalex.org/W2161556771","https://openalex.org/W2164728168","https://openalex.org/W2167947550","https://openalex.org/W2171187077","https://openalex.org/W2402734550","https://openalex.org/W2411080135","https://openalex.org/W2997134027","https://openalex.org/W4213060883","https://openalex.org/W4242651323","https://openalex.org/W6602388437","https://openalex.org/W6653067108","https://openalex.org/W6682095816","https://openalex.org/W6685221372","https://openalex.org/W6713532335","https://openalex.org/W6714578064"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W102815760","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W2593184009"],"abstract_inverted_index":{"This":[0],"work":[1],"improves":[2],"algorithms":[3,51],"for":[4,53],"finding":[5],"network":[6],"flows":[7],"both":[8,71,99],"sustainable":[9,106],"and":[10,30,73,105,126,134],"robust":[11,104],"against":[12],"multilink-attack":[13],"(MLA).":[14],"It":[15,58],"brings":[16],"out":[17],"the":[18,60,93,102,135,138],"relationship":[19],"between":[20],"sustainability":[21],"(flow":[22,32],"solution":[23,69],"before":[24],"attack":[25,35],"known":[26,36,43],"as":[27,37,145],"MLA-reliable":[28,74],"flow)":[29],"robustness":[31],"value":[33],"after":[34],"MLA-robust":[38,72],"flow).":[39],"Both":[40],"problems":[41,100,117],"are":[42],"to":[44,70,98,119,122],"be":[45],"NP-hard.":[46],"However,":[47],"exact":[48],"polynomial":[49],"time":[50],"exist":[52],"certain":[54],"categories":[55],"of":[56,78,113,132,137],"network.":[57],"includes":[59],"Extended":[61],"Multiroute":[62],"Flow":[63],"(EMRF)":[64],"algorithm":[65,97],"that":[66],"exhibits":[67],"a":[68,88],"flows.":[75],"The":[76,129],"class":[77],"networks":[79,144,147],"solved":[80],"by":[81,86],"EMRF":[82,114,133],"is":[83,101,140],"extended":[84],"here":[85],"using":[87],"capacity":[89],"differentiation":[90],"method.":[91],"Although,":[92],"previous":[94],"best-known":[95],"approximation":[96,139],"naturally":[103],"multiroute":[107],"flow":[108],"algorithm.":[109],"A":[110],"deeper":[111],"analysis":[112],"an":[115],"MLA":[116],"leads":[118],"new":[120],"methods":[121],"find":[123],"tighter":[124],"upper":[125],"lower":[127],"bounds.":[128],"success":[130],"rate":[131],"quality":[136],"evaluated":[141],"on":[142],"practical":[143],"complex":[146],"or":[148],"grids.":[149]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}