{"id":"https://openalex.org/W183428525","doi":"https://doi.org/10.1007/978-3-319-04657-0_9","title":"A (k\u2009+\u20091)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow","display_name":"A (k\u2009+\u20091)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W183428525","doi":"https://doi.org/10.1007/978-3-319-04657-0_9","mag":"183428525"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-04657-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04657-0_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/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/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]}],"countries":["FR","JP"],"is_corresponding":true,"raw_author_name":"Jean-Fran\u00e7ois Baffier","raw_affiliation_strings":["Universit\u00e9 Paris-Sud, JFLI, CNRS, The University of Tokyo, Japan","The University of Tokyo"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Sud, JFLI, CNRS, The University of Tokyo, Japan","institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"The University of Tokyo","institution_ids":["https://openalex.org/I74801974"]}]},{"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/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":["ERATO, Kawarabayashi Large Graph Project, NII, JST, Japan","NII, JST"],"affiliations":[{"raw_affiliation_string":"ERATO, Kawarabayashi Large Graph Project, NII, JST, Japan","institution_ids":["https://openalex.org/I4210086780"]},{"raw_affiliation_string":"NII, JST","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048185370"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I74801974"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.8029,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90764907,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"68","last_page":"79"},"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.9984999895095825,"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.9984999895095825,"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.9907000064849854,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9840999841690063,"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7748769521713257},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6980581283569336},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5589044690132141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5449491739273071},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5246620178222656},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4461122155189514},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43558287620544434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42456063628196716},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.41988605260849},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41091281175613403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34875279664993286},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.286842405796051},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12994349002838135},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06069222092628479}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7748769521713257},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6980581283569336},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5589044690132141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5449491739273071},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5246620178222656},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4461122155189514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43558287620544434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42456063628196716},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.41988605260849},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41091281175613403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34875279664993286},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.286842405796051},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12994349002838135},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06069222092628479}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-04657-0_9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04657-0_9","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-02399331v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02399331","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms and Computation, pp.68-79, 2014, ⟨10.1007/978-3-319-04657-0_9⟩","raw_type":"Book sections"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1519184063","https://openalex.org/W1538983961","https://openalex.org/W1577821161","https://openalex.org/W1589421353","https://openalex.org/W1952568655","https://openalex.org/W1964119857","https://openalex.org/W1971368313","https://openalex.org/W1972661641","https://openalex.org/W1976969221","https://openalex.org/W1983383464","https://openalex.org/W2035974993","https://openalex.org/W2082707864","https://openalex.org/W2093227716","https://openalex.org/W2112006606","https://openalex.org/W2112872727","https://openalex.org/W2130058894","https://openalex.org/W2150700871","https://openalex.org/W2161556771","https://openalex.org/W2798581266","https://openalex.org/W2950447941","https://openalex.org/W2997134027","https://openalex.org/W4237640572","https://openalex.org/W4241120104","https://openalex.org/W6600707886"],"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":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}