{"id":"https://openalex.org/W4417473711","doi":"https://doi.org/10.48550/arxiv.2512.14457","title":"An Improved Approximation Algorithm for Maximum Weight 3-Path Packing","display_name":"An Improved Approximation Algorithm for Maximum Weight 3-Path Packing","publication_year":2025,"publication_date":"2025-12-16","ids":{"openalex":"https://openalex.org/W4417473711","doi":"https://doi.org/10.48550/arxiv.2512.14457"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2512.14457","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.14457","pdf_url":"https://arxiv.org/pdf/2512.14457","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2512.14457","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037988025","display_name":"Jingyang Zhao","orcid":"https://orcid.org/0000-0003-2322-750X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Jingyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033729619","display_name":"Mingyu Xiao","orcid":"https://orcid.org/0000-0002-1012-2373"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao, Mingyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8633999824523926,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.8633999824523926,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0681999996304512,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.011800000444054604,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6129000186920166},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.593999981880188},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5253000259399414},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4666999876499176},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.460999995470047},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4196000099182129},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.3476000130176544},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.32829999923706055}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7389000058174133},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6129000186920166},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.593999981880188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5390999913215637},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5253000259399414},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5198000073432922},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4666999876499176},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.460999995470047},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4196000099182129},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3377000093460083},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.3255000114440918},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.30079999566078186},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.28349998593330383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27320000529289246},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C109111794","wikidata":"https://www.wikidata.org/wiki/Q730933","display_name":"Dinic's algorithm","level":5,"score":0.2612999975681305},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.2563000023365021}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2512.14457","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.14457","pdf_url":"https://arxiv.org/pdf/2512.14457","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2512.14457","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.14457","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2512.14457","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.14457","pdf_url":"https://arxiv.org/pdf/2512.14457","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417473711.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Given":[0],"a":[1,26,62,78,133,138],"complete":[2],"graph":[3],"with":[4],"$n$":[5,12],"vertices":[6],"and":[7,107],"non-negative":[8],"edge":[9],"weights,":[10],"where":[11],"is":[13,23,43,47,74,85,97,110,122,146],"divisible":[14],"by":[15,76],"3,":[16],"the":[17,34,38,41,51,66,88,95,100,108,123,126],"maximum":[18,53,89,101],"weight":[19,36,54,90,102],"3-path":[20],"packing":[21,42],"problem":[22,46],"to":[24,50,150,160],"find":[25],"set":[27],"of":[28,37,92,104],"$n/3$":[29],"vertex-disjoint":[30],"3-paths":[31,39],"such":[32],"that":[33],"total":[35],"in":[40],"maximized.":[44],"This":[45],"closely":[48],"related":[49,165],"classic":[52],"matching":[55,91,103],"problem.":[56],"In":[57],"this":[58,143],"paper,":[59],"we":[60,131],"propose":[61,132],"$10/17$-approximation":[63],"algorithm,":[64,129],"improving":[65],"best-known":[67],"$7/12$-approximation":[68,128],"algorithm":[69,115,121,154],"(ESA":[70],"2015).":[71],"Our":[72,119],"result":[73],"obtained":[75],"making":[77],"trade-off":[79],"among":[80],"three":[81],"algorithms.":[82],"The":[83],"first":[84,120],"based":[86,98,111],"on":[87,99,112],"size":[93,105],"$n/2$,":[94],"second":[96,153],"$n/3$,":[106],"last":[109],"an":[113],"approximation":[114],"for":[116,142,163],"star":[117],"packing.":[118],"same":[124],"as":[125],"previous":[127],"but":[130,155],"new":[134],"analysis":[135],"method":[136,140],"--":[137,141],"charging":[139],"problem,":[144],"which":[145],"not":[147],"only":[148],"essential":[149],"analyze":[151,161],"our":[152],"also":[156],"may":[157],"be":[158],"extended":[159],"algorithms":[162],"some":[164],"problems.":[166]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-18T00:00:00"}