{"id":"https://openalex.org/W2974905735","doi":"https://doi.org/10.15439/2019f85","title":"Exact and approximation algorithms for joint routing and flow rate optimization","display_name":"Exact and approximation algorithms for joint routing and flow rate optimization","publication_year":2019,"publication_date":"2019-09-20","ids":{"openalex":"https://openalex.org/W2974905735","doi":"https://doi.org/10.15439/2019f85","mag":"2974905735"},"language":"en","primary_location":{"id":"doi:10.15439/2019f85","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2019f85","pdf_url":"https://annals-csis.org/proceedings/2019/drp/pdf/85.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2019/drp/pdf/85.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075356637","display_name":"Konstanty Junosza-Szaniawski","orcid":"https://orcid.org/0000-0003-0352-8583"},"institutions":[{"id":"https://openalex.org/I108403487","display_name":"Warsaw University of Technology","ror":"https://ror.org/00y0xnp53","country_code":"PL","type":"education","lineage":["https://openalex.org/I108403487"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Konstanty Junosza-Szaniawski","raw_affiliation_strings":["Warsaw University of Technology Faculty of Mathematics and Information Science ul. Koszykowa 75, 00-662 Warszawa, Poland"],"affiliations":[{"raw_affiliation_string":"Warsaw University of Technology Faculty of Mathematics and Information Science ul. Koszykowa 75, 00-662 Warszawa, Poland","institution_ids":["https://openalex.org/I108403487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005434213","display_name":"Dariusz Nogalski","orcid":"https://orcid.org/0000-0002-3921-3199"},"institutions":[{"id":"https://openalex.org/I4210124436","display_name":"Military Communication Institute","ror":"https://ror.org/02vwh7h84","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210124436"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Dariusz Nogalski","raw_affiliation_strings":["Military Communication Institute C4I Systems Department ul. Warszawska 22A, 05-130 Zegrze, Poland"],"affiliations":[{"raw_affiliation_string":"Military Communication Institute C4I Systems Department ul. Warszawska 22A, 05-130 Zegrze, Poland","institution_ids":["https://openalex.org/I4210124436"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005434213"],"corresponding_institution_ids":["https://openalex.org/I4210124436"],"apc_list":null,"apc_paid":null,"fwci":0.3546,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.55750225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":null,"first_page":"29","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9994000196456909,"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/heuristics","display_name":"Heuristics","score":0.7746226787567139},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6836990118026733},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6810271739959717},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6027454733848572},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5298476219177246},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5032762885093689},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4881618618965149},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47084876894950867},{"id":"https://openalex.org/keywords/linear-approximation","display_name":"Linear approximation","score":0.4644676744937897},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46374306082725525},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4393087327480316},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.34538358449935913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19040891528129578}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7746226787567139},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6836990118026733},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6810271739959717},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6027454733848572},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5298476219177246},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5032762885093689},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4881618618965149},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47084876894950867},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.4644676744937897},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46374306082725525},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4393087327480316},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.34538358449935913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19040891528129578},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2019f85","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2019f85","pdf_url":"https://annals-csis.org/proceedings/2019/drp/pdf/85.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:f7916d52bda04b83ba5c1f218f8f97c6","is_oa":true,"landing_page_url":"https://doaj.org/article/f7916d52bda04b83ba5c1f218f8f97c6","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 20, Pp 29-36 (2019)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2019f85","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2019f85","pdf_url":"https://annals-csis.org/proceedings/2019/drp/pdf/85.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2974905735.pdf","grobid_xml":"https://content.openalex.org/works/W2974905735.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1575554886","https://openalex.org/W1966109186","https://openalex.org/W2003160050","https://openalex.org/W2006146932","https://openalex.org/W2084423239","https://openalex.org/W2106007310","https://openalex.org/W2122205547","https://openalex.org/W2128134199","https://openalex.org/W2140780473","https://openalex.org/W2147524058","https://openalex.org/W2150148016","https://openalex.org/W2158893758","https://openalex.org/W2159715570","https://openalex.org/W2159788619","https://openalex.org/W2165956524","https://openalex.org/W2221372013","https://openalex.org/W2326283862","https://openalex.org/W2551026584","https://openalex.org/W2626075996","https://openalex.org/W2795205883","https://openalex.org/W6676036374"],"related_works":["https://openalex.org/W2367938014","https://openalex.org/W2201623492","https://openalex.org/W2017216075","https://openalex.org/W3122413977","https://openalex.org/W96441109","https://openalex.org/W2023374895","https://openalex.org/W143765064","https://openalex.org/W4391069889","https://openalex.org/W2885465588","https://openalex.org/W189995875"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,11,27,35,38,42,73],"comparison":[4],"of":[5,10,20,72,83],"algorithms":[6],"for":[7,65],"a":[8,66,76],"version":[9],"Network":[12],"Utility":[13],"Maximization":[14],"(NUM)":[15],"problem.":[16],"The":[17,60,70],"joint":[18],"formulation":[19],"routing":[21],"and":[22,29,48,55,81],"transmission":[23],"rate":[24],"control":[25],"within":[26,34],"multi-user":[28],"single-path":[30],"setting":[31],"is":[32,40,63],"assumed":[33],"NUM.":[36],"Since":[37],"problem":[39],"NP-hard,":[41],"efficient":[43],"heuristics":[44,54],"are":[45],"designed,":[46],"implemented":[47],"compared":[49],"experimentally":[50],"with":[51],"other":[52],"existing":[53],"exact":[56],"linear":[57,61],"programming":[58],"solver.":[59],"approximation":[62],"applied":[64],"nonlinear":[67],"utility":[68],"function.":[69],"results":[71],"experiments":[74],"demonstrate":[75],"trade-off":[77],"between":[78],"computing":[79],"time":[80],"precision":[82],"goal":[84],"value.":[85]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}