{"id":"https://openalex.org/W2917331219","doi":"https://doi.org/10.1007/978-3-030-24766-9_2","title":"On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow","display_name":"On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2917331219","doi":"https://doi.org/10.1007/978-3-030-24766-9_2","mag":"2917331219"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-24766-9_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-24766-9_2","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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.7155/jgaa.00534","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026261798","display_name":"Kate\u0159ina Altmanov\u00e1","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kate\u0159ina Altmanov\u00e1","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080963999","display_name":"Petr Kolman","orcid":"https://orcid.org/0000-0003-2235-0506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petr Kolman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045123287","display_name":"Jan Voborn\u00edk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jan Voborn\u00edk","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5026261798"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04135468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"3","first_page":"14","last_page":"27"},"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.9991000294685364,"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.9991000294685364,"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.9987999796867371,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/bounded-function","display_name":"Bounded function","score":0.8504517078399658},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6913471817970276},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6319239735603333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.62699955701828},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5125644207000732},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4925471246242523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4418374001979828},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4382195472717285},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42799314856529236},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4218553304672241}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8504517078399658},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6913471817970276},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6319239735603333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.62699955701828},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5125644207000732},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4925471246242523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4418374001979828},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4382195472717285},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42799314856529236},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4218553304672241},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-030-24766-9_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-24766-9_2","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":"doi:10.7155/jgaa.00534","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00534","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1902.07568","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1902.07568","pdf_url":"https://arxiv.org/pdf/1902.07568","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:2917331219","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1902.07568v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1902.07568","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1902.07568","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.00534","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.00534","pdf_url":null,"source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1496951856","https://openalex.org/W1784825978","https://openalex.org/W1875643871","https://openalex.org/W1964443412","https://openalex.org/W1999679195","https://openalex.org/W2000733920","https://openalex.org/W2025838844","https://openalex.org/W2074117023","https://openalex.org/W2117595194","https://openalex.org/W2122205547","https://openalex.org/W2129239025","https://openalex.org/W2130626677","https://openalex.org/W2171565779","https://openalex.org/W2181839983","https://openalex.org/W2262201633","https://openalex.org/W2790988318","https://openalex.org/W2888538681"],"related_works":["https://openalex.org/W3035852163","https://openalex.org/W2613128454","https://openalex.org/W2808514443","https://openalex.org/W1772507020","https://openalex.org/W2042977557","https://openalex.org/W2738162363","https://openalex.org/W2944918303","https://openalex.org/W2123734400","https://openalex.org/W1523755288","https://openalex.org/W3158696645","https://openalex.org/W2183936573","https://openalex.org/W3007661461","https://openalex.org/W1506627918","https://openalex.org/W2770160826","https://openalex.org/W3184951419","https://openalex.org/W154567010","https://openalex.org/W3158676953","https://openalex.org/W2950262288","https://openalex.org/W1597339518","https://openalex.org/W2022490362"],"abstract_inverted_index":{"Given":[0],"a":[1,18,46,51,126,175,186,230],"graph":[2],"$G=(V,E)$":[3],"with":[4,62,69,74],"two":[5],"distinguished":[6],"vertices":[7,55],"$s,t\\in":[8],"V$":[9],"and":[10,22,139,149],"an":[11,14],"integer":[12],"$L$,":[13],"$L$-bounded":[15,38,48,104,132,191,222],"flow":[16,19,39,49,105,133,192,223],"is":[17,43,106,114,199],"between":[20,50],"$s$":[21],"$t$":[23],"that":[24,119,184,210,236],"can":[25,83],"be":[26,84],"decomposed":[27],"into":[28],"paths":[29],"of":[30,54,79,159,170,188,202,219],"length":[31,182],"at":[32],"most":[33],"$L$.":[34],"In":[35,166],"the":[36,41,57,77,81,103,112,130,150,156,167,180,189,200,205,216,220,234],"maximum":[37,47,131,190,221],"problem":[40,82,113,134,224],"task":[42],"to":[44,76,124],"find":[45],"given":[52],"pair":[53],"in":[56,86,141,155,193,204,225,233],"input":[58],"graph.":[59,206],"For":[60,108],"networks":[61],"unit":[63],"edge":[64,72,110,228],"lengths":[65],"(or,":[66],"more":[67],"generally,":[68],"polynomially":[70],"bounded":[71],"lengths,":[73,111],"respect":[75],"number":[78,201],"vertices),":[80],"solved":[85],"polynomial":[87],"time":[88,194],"using":[89],"linear":[90,242,248],"programming.":[91],"However,":[92],"as":[93,95],"far":[94],"we":[96,120,162,173,208],"know,":[97],"no":[98],"polynomial-time":[99],"combinatorial":[100,127,176],"algorithm1":[101],"for":[102,129,215],"known.":[107],"general":[109],"NP-hard.":[115],"The":[116],"only":[117],"attempt,":[118],"are":[121],"aware":[122],"of,":[123],"describe":[125,163,174],"algorithm":[128,151,177],"was":[135],"done":[136],"by":[137],"Koubek":[138],"\u0158\u00edha":[140],"1981.":[142],"Unfortunately,":[143],"their":[144],"paper":[145,172],"contains":[146],"substantial":[147],"flaws":[148],"does":[152,238],"not":[153,239],"work;":[154],"first":[157],"part":[158,169],"this":[160,171,211],"paper,":[161],"these":[164],"problems.":[165],"second":[168],"based":[178],"on":[179],"exponential":[181],"method":[183],"finds":[185],"$(1+\\varepsilon)$-approximation":[187],"$\\mathcal{O}(\\varepsilon^{-2}m^2L\\log":[195],"L)$":[196],"where":[197],"$m$":[198],"edges":[203],"Moreover,":[207],"show":[209],"approach":[212],"works":[213],"even":[214],"NP-hard":[217],"generalization":[218],"which":[226],"each":[227],"has":[229],"length.":[231],"1Combinatorial":[232],"sense":[235],"it":[237],"explicitly":[240],"use":[241],"programming":[243],"methods":[244,246],"or":[245,250],"from":[247],"algebra":[249],"convex":[251],"geometry.":[252]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}