{"id":"https://openalex.org/W7078744912","doi":"https://doi.org/10.4230/lipics.wads.2025.28","title":"Approximation Algorithms for the Generalized Point-To-Point Problem","display_name":"Approximation Algorithms for the Generalized Point-To-Point Problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7078744912","doi":"https://doi.org/10.4230/lipics.wads.2025.28"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24259","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.28","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.28/LIPIcs.WADS.2025.28.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.28/LIPIcs.WADS.2025.28.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Friggstad, Zachary","orcid":"https://orcid.org/0000-0003-4039-3235"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Friggstad, Zachary","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, Canada"],"raw_orcid":"https://orcid.org/0000-0003-4039-3235","affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Salavatipour, Mohammad R.","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Salavatipour, Mohammad R.","raw_affiliation_strings":["Department of Computing Science, University of Alberta, Edmonton, Canada"],"raw_orcid":"https://orcid.org/0000-0002-7650-2045","affiliations":[{"raw_affiliation_string":"Department of Computing Science, University of Alberta, Edmonton, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":null,"display_name":"Sun, Hao","orcid":"https://orcid.org/0000-0002-2000-8080"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sun, Hao","raw_affiliation_strings":["Department of Computer Science, University of Houston, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-2000-8080","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.4806046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.0215000007301569,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.0215000007301569,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11836","display_name":"Bryophyte Studies and Records","score":0.0210999995470047,"subfield":{"id":"https://openalex.org/subfields/1105","display_name":"Ecology, Evolution, Behavior and Systematics"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T12073","display_name":"Isotope Analysis in Ecology","score":0.017500000074505806,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.650600016117096},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6219000220298767},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5450000166893005},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5034999847412109},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4745999872684479},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4740999937057495},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.46950000524520874},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4530999958515167},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.43720000982284546}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.650600016117096},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6219000220298767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5774999856948853},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5450000166893005},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5034999847412109},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4745999872684479},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4740999937057495},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.46950000524520874},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4530999958515167},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4424000084400177},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.43720000982284546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4106000065803528},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.3871000111103058},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.382099986076355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3783999979496002},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.350600004196167},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3433000147342682},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3336000144481659},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3294999897480011},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3050000071525574},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.29649999737739563},{"id":"https://openalex.org/C188082385","wikidata":"https://www.wikidata.org/wiki/Q73792","display_name":"Charge (physics)","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C120330832","wikidata":"https://www.wikidata.org/wiki/Q166656","display_name":"Supply and demand","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.265500009059906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25760000944137573},{"id":"https://openalex.org/C50524431","wikidata":"https://www.wikidata.org/wiki/Q4545814","display_name":"1-center problem","level":3,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:24259","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.28","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.28/LIPIcs.WADS.2025.28.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.wads.2025.28","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.wads.2025.28","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:24259","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WADS.2025.28","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol349-wads2025/LIPIcs.WADS.2025.28/LIPIcs.WADS.2025.28.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"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":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.45928454399108887}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7078744912.pdf","grobid_xml":"https://content.openalex.org/works/W7078744912.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,42,57,63,79,94,100,115,123,152,160,168,172,200,206,216,225,267],"Generalized":[3],"Point-to-Point":[4],"(GP2P)":[5],"problem":[6,58,82],"in":[7,144,205,224,230,239,270,278],"which":[8],"we":[9,180,214,235,264],"have":[10],"an":[11,140],"edge-weighted":[12],"graph":[13],"G":[14],"with":[15,147],"(possibly":[16],"negative)":[17],"node":[18,254],"charges":[19,44,50],"\u03d5(v)":[20,248],"\u2208":[21],"\u2124.":[22],"The":[23],"goal":[24],"is":[25,59,69,83,121,155,208],"to":[26,61,71,191,219,276],"find":[27],"a":[28,84,165,197,211,237],"minimum-cost":[29],"set":[30],"of":[31,87,103,202,227],"edges":[32],"such":[33,92,258],"that":[34,67],"each":[35,253],"component":[36],"has":[37],"nonnegative":[38],"total":[39,153,161,169,173],"charge.":[40],"Viewing":[41],"positive":[43],"as":[45,51,93],"specifying":[46],"supply":[47,154,170],"and":[48,113,163,247,256,262],"negative":[49],"demand":[52,108,203,228],"quantities":[53],"at":[54],"various":[55],"nodes,":[56],"equivalent":[60],"build":[62],"cheapest":[64],"network":[65,89],"so":[66],"it":[68],"possible":[70],"satisfy":[72],"all":[73,114,245],"demands":[74],"by":[75,130,210],"routing":[76],"supplies":[77],"across":[78],"network.":[80],"This":[81],"significant":[85],"generalization":[86],"other":[88,116],"design":[90],"problems":[91],"well-studied":[95],"Steiner":[96],"Forest":[97],"problem.":[98,127],"Even":[99],"special":[101],"case":[102],"only":[104,196],"having":[105,118],"one":[106],"single":[107],"point":[109],"(having":[110],"charge":[111,119],"-k":[112],"nodes":[117],"+1)":[120],"capturing":[122],"k-Minimum":[124,184],"Spanning":[125,185],"Tree":[126,186],"Earlier":[128],"work":[129,272],"Hajiaghayi":[131],"et":[132,136],"al.":[133],"(2016)":[134],"[Hajiaghayi":[135],"al.,":[137],"2016]":[138],"gave":[139],"O(log":[141],"n)":[142],"approximation":[143],"pseudo-polynomial":[145],"time":[146,218],"further":[148],"improved":[149],"guarantees":[150],"if":[151,167,199],"not":[156],"much":[157],"larger":[158],"than":[159],"demand,":[162],"also":[164],"2-approximation":[166,238],"equals":[171],"demand.":[174],"Our":[175],"contributions":[176],"are":[177,244,260],"four-fold:":[178],"(a)":[179],"show":[181,257,265],"how":[182,266],"known":[183],"approximations":[187,193,269],"can":[188,273],"be":[189,220,274],"extended":[190],"GP2P":[192],"while":[194],"losing":[195],"\u03b5-factor":[198],"number":[201,226],"points":[204,229],"instance":[207],"bounded":[209],"constant,":[212],"(b)":[213],"improve":[215],"running":[217],"Fixed-Parameter":[221],"Tractable":[222],"(FPT)":[223],"constant-dimensional":[231],"Euclidean":[232],"metrics,":[233],"(c)":[234],"give":[236],"instances":[240,259],"where":[241],"edge":[242],"costs":[243],"1":[246,251],"=":[249],"\u00b1":[250],"for":[252],"v":[255],"APX-hard,":[261],"(d)":[263],"logarithmic":[268],"earlier":[271],"modified":[275],"run":[277],"truly":[279],"polynomial":[280],"time.":[281]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}