{"id":"https://openalex.org/W3128680608","doi":"https://doi.org/10.3390/a14020048","title":"Safe Approximation\u2014An Efficient Solution for a Hard Routing Problem","display_name":"Safe Approximation\u2014An Efficient Solution for a Hard Routing Problem","publication_year":2021,"publication_date":"2021-02-02","ids":{"openalex":"https://openalex.org/W3128680608","doi":"https://doi.org/10.3390/a14020048","mag":"3128680608"},"language":"en","primary_location":{"id":"doi:10.3390/a14020048","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14020048","pdf_url":"https://www.mdpi.com/1999-4893/14/2/48/pdf?version=1613610155","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/2/48/pdf?version=1613610155","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009539372","display_name":"Andr\u00e1s Farag\u00f3","orcid":"https://orcid.org/0000-0001-8952-6946"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andr\u00e1s Farag\u00f3","raw_affiliation_strings":["Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, P.O.B. 830688, MS-EC31, Richardson, TX 75080, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, P.O.B. 830688, MS-EC31, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075994296","display_name":"Zohre R. Mojaveri","orcid":"https://orcid.org/0000-0003-2170-8318"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zohre R. Mojaveri","raw_affiliation_strings":["Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, P.O.B. 830688, MS-EC31, Richardson, TX 75080, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Erik Jonsson School of Engineering and Computer Science, The University of Texas at Dallas, P.O.B. 830688, MS-EC31, Richardson, TX 75080, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075994296"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.148,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46955031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"14","issue":"2","first_page":"48","last_page":"48"},"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.9998999834060669,"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.9998999834060669,"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.9980000257492065,"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.9968000054359436,"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.6054703593254089},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5809244513511658},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5505452752113342},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.47217458486557007},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4541435241699219},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4209854304790497},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4127758741378784},{"id":"https://openalex.org/keywords/rendering","display_name":"Rendering (computer graphics)","score":0.41055572032928467},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.41027188301086426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33460134267807007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3241332471370697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26186496019363403}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6054703593254089},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5809244513511658},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5505452752113342},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.47217458486557007},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4541435241699219},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4209854304790497},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4127758741378784},{"id":"https://openalex.org/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.41055572032928467},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.41027188301086426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33460134267807007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3241332471370697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26186496019363403},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14020048","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14020048","pdf_url":"https://www.mdpi.com/1999-4893/14/2/48/pdf?version=1613610155","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cbb2a5ee90c442dbb31a35c591c0557f","is_oa":true,"landing_page_url":"https://doaj.org/article/cbb2a5ee90c442dbb31a35c591c0557f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 2, p 48 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/2/48/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14020048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 2; Pages: 48","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14020048","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14020048","pdf_url":"https://www.mdpi.com/1999-4893/14/2/48/pdf?version=1613610155","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3128680608.pdf","grobid_xml":"https://content.openalex.org/works/W3128680608.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1593787329","https://openalex.org/W1729731282","https://openalex.org/W2003160050","https://openalex.org/W2005079828","https://openalex.org/W2023176678","https://openalex.org/W2032312374","https://openalex.org/W2034269606","https://openalex.org/W2040785801","https://openalex.org/W2041884875","https://openalex.org/W2062948942","https://openalex.org/W2066356146","https://openalex.org/W2129239025","https://openalex.org/W2135424293","https://openalex.org/W2401610261","https://openalex.org/W2912533262","https://openalex.org/W3011766368","https://openalex.org/W6651700670","https://openalex.org/W6666227138"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157"],"abstract_inverted_index":{"The":[0,108],"Disjoint":[1],"Connecting":[2],"Paths":[3],"problem":[4,84],"and":[5,25,94,157,220],"its":[6],"capacitated":[7],"generalization,":[8],"called":[9],"Unsplittable":[10],"Flow":[11],"problem,":[12],"play":[13],"an":[14,139],"important":[15,154],"role":[16],"in":[17,31,61,85,166,191],"practical":[18,192,203],"applications":[19],"such":[20],"as":[21,217],"communication":[22],"network":[23],"design":[24],"routing.":[26],"These":[27],"tasks":[28],"are":[29,37,180,189],"NP-hard":[30,99],"general,":[32],"but":[33],"various":[34],"polynomial-time":[35],"approximations":[36,41],"known.":[38],"Nevertheless,":[39],"the":[40,52,81,90,121,136,144,152,171,202,209,222,249],"tend":[42],"to":[43,69,97,101,104,147,183,243],"be":[44,233],"either":[45],"too":[46,55],"loose":[47],"(allowing":[48],"large":[49,86,106],"deviation":[50],"from":[51,201],"optimum),":[53],"or":[54],"complicated,":[56],"often":[57],"rendering":[58],"them":[59],"impractical":[60],"large,":[62],"complex":[63],"networks.":[64],"Therefore,":[65],"our":[66,111],"goal":[67],"is":[68,92,95,113,151,164,198],"present":[70],"a":[71,75,105,117,127,148,160,253],"solution":[72,122,145],"that":[73,150,163,211,228],"provides":[74],"relatively":[76],"simple,":[77],"efficient":[78],"algorithm":[79,112],"for":[80,130,138,155],"unsplittable":[82],"flow":[83],"directed":[87],"graphs,":[88],"where":[89,177],"task":[91],"NP-hard,":[93],"known":[96],"remain":[98],"even":[100],"approximate":[102],"up":[103,135],"factor.":[107],"efficiency":[109],"of":[110,120,205],"achieved":[114],"by":[115,252],"sacrificing":[116],"small":[118,161],"part":[119,162,173],"space.":[123],"This":[124],"also":[125],"represents":[126],"novel":[128],"paradigm":[129],"approximation.":[131,225],"Rather":[132],"than":[133],"giving":[134],"search":[137],"exact":[140,250],"solution,":[141],"we":[142,240,246],"restrict":[143,241],"space":[146],"subset":[149],"most":[153],"applications,":[156,193],"excludes":[158],"only":[159,174],"marginal":[165],"some":[167,178],"well-defined":[168],"sense.":[169],"Specifically,":[170],"sacrificed":[172],"contains":[175],"scenarios":[176],"edges":[179,216],"very":[181],"close":[182],"saturation.":[184],"Since":[185],"nearly":[186,214],"saturated":[187,215],"links":[188],"undesirable":[190],"therefore,":[194],"excluding":[195],"near":[196],"saturation":[197],"quite":[199],"reasonable":[200],"point":[204],"view.":[206],"We":[207,226],"refer":[208],"solutions":[210],"contain":[212],"no":[213],"safe":[218,224,230,244],"solutions,":[219,245],"call":[221],"approach":[223],"prove":[227],"this":[229],"approximation":[231],"can":[232,247],"carried":[234],"out":[235],"efficiently.":[236],"That":[237],"is,":[238],"once":[239],"ourselves":[242],"find":[248],"optimum":[251],"randomized":[254],"polynomial":[255],"time":[256],"algorithm.":[257]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}