{"id":"https://openalex.org/W7204838652","doi":"https://doi.org/10.48550/arxiv.2608.27607","title":"Approximating the Rural Postman Problem below 3/2","display_name":"Approximating the Rural Postman Problem below 3/2","publication_year":2026,"publication_date":"2026-08-27","ids":{"openalex":"https://openalex.org/W7204838652","doi":"https://doi.org/10.48550/arxiv.2608.27607"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.27607","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.27607","pdf_url":"https://arxiv.org/pdf/2608.27607","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2608.27607","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5148781761","display_name":"Hong Li","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Li, Hong","raw_affiliation_strings":["School of Mathematics and Statistics , Yunnan University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics , Yunnan University ,","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5158709720","display_name":"Jianping Li","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Jianping","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5158699989","display_name":"Wei Li","orcid":"https://orcid.org/0000-0003-2543-2558","observed_orcids":["https://orcid.org/0000-0003-2543-2558"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Wei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031253598","display_name":"Runtao Xie","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xie, Runtao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137126741","display_name":"Xiaoxiao Yang","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Xiaoxiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955999851226807,"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.9955999851226807,"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.0026000000070780516,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0006000000284984708,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rural-postman-problem","display_name":"rural postman problem","score":0.9980000257492065},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9800000190734863},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.7829999923706055},{"id":"https://openalex.org/keywords/metric-traveling-salesman-problem","display_name":"metric traveling salesman problem","score":0.9200000166893005},{"id":"https://openalex.org/keywords/maximum-entropy-distribution","display_name":"maximum entropy distribution","score":0.7760000228881836},{"id":"https://openalex.org/keywords/sampling","display_name":"sampling","score":0.5830000042915344},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"hardness of approximation","score":0.8799999952316284},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.5889999866485596}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8684999942779541},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7091000080108643},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5238000154495239},{"id":"https://openalex.org/C138600008","wikidata":"https://www.wikidata.org/wiki/Q498144","display_name":"Christofides algorithm","level":4,"score":0.5164999961853027},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5016999840736389},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47839999198913574},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.47519999742507935},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44339999556541443},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.44190001487731934},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.3449000120162964},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.32679998874664307},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.2662000060081482},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.27607","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.27607","pdf_url":"https://arxiv.org/pdf/2608.27607","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.27607","doi":"https://doi.org/10.48550/arxiv.2608.27607","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.27607","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.27607","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.27607","pdf_url":"https://arxiv.org/pdf/2608.27607","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7204838652.pdf","grobid_xml":"https://content.openalex.org/works/W7204838652.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7162417838","https://openalex.org/W2913710720","https://openalex.org/W181017499","https://openalex.org/W3135507527","https://openalex.org/W2062403584","https://openalex.org/W7131780309","https://openalex.org/W6977282478","https://openalex.org/W4311717631","https://openalex.org/W4226003954","https://openalex.org/W1973867178"],"abstract_inverted_index":{"We":[0,17,48],"give":[1],"an":[2,66],"approximation":[3,11],"algorithm":[4,58,68],"for":[5,36,52,59,69],"the":[6,24,28,37,60,70,80,89,94,97],"rural":[7,25,71],"postman":[8,26,72],"problem":[9,27,41,64],"with":[10],"ratio":[12],"strictly":[13],"smaller":[14],"than":[15],"$3/2$.":[16],"obtain":[18],"this":[19,74],"result":[20],"by":[21],"adapting":[22],"to":[23],"technique":[29],"of":[30,42,82,91,96],"sampling":[31],"from":[32],"maximum":[33],"entropy":[34],"distributions":[35],"metric":[38,61],"traveling":[39,62,98],"salesman":[40,63,99],"Karlin,":[43],"Klein,":[44],"and":[45],"Oveis":[46],"Gharan.":[47],"also":[49],"observe":[50],"that,":[51],"every":[53],"fixed":[54],"$\\varepsilon>0$,":[55],"any":[56],"$\u03b1$-approximation":[57],"yields":[65],"$(\u03b1+\\varepsilon)$-approximation":[67],"problem;":[73],"implication":[75],"is":[76],"already":[77],"implicit":[78],"in":[79,88],"treatment":[81],"edges":[83],"that":[84],"must":[85],"be":[86],"traversed":[87],"work":[90],"Lampis":[92],"on":[93],"inapproximability":[95],"problem.":[100]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-01T00:00:00"}