{"id":"https://openalex.org/W4404987915","doi":"https://doi.org/10.48550/arxiv.2411.16600","title":"Approximation Algorithms for Combinatorial Optimization with Predictions","display_name":"Approximation Algorithms for Combinatorial Optimization with Predictions","publication_year":2024,"publication_date":"2024-11-25","ids":{"openalex":"https://openalex.org/W4404987915","doi":"https://doi.org/10.48550/arxiv.2411.16600"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2411.16600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.16600","pdf_url":"https://arxiv.org/pdf/2411.16600","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2411.16600","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050100279","display_name":"Antonios P. Antoniadis","orcid":"https://orcid.org/0000-0002-6604-5581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Antoniadis, Antonios","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035053302","display_name":"Marek Eli\u00e1\u0161","orcid":"https://orcid.org/0000-0003-4583-8897"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eli\u00e1\u0161, Marek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064315511","display_name":"Adam Polak","orcid":"https://orcid.org/0000-0003-4925-774X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Polak, Adam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5114619747","display_name":"Moritz Venzin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venzin, Moritz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9297999739646912,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9297999739646912,"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/algorithm","display_name":"Algorithm","score":0.49397069215774536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.460279643535614},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3659436106681824},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30942320823669434}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49397069215774536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.460279643535614},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3659436106681824},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30942320823669434}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:arXiv.org:2411.16600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.16600","pdf_url":"https://arxiv.org/pdf/2411.16600","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/12817a32-676f-42e0-995c-eb3aa594017d","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/12817a32-676f-42e0-995c-eb3aa594017d","pdf_url":"https://ris.utwente.nl/ws/files/521875399/7901_Approximation_algorithms_.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Antoniadis, A, Eli\u00e1\u0161, M, Polak, A & Venzin, M 2025, 'Approximation algorithms for combinatorial optimization with predictions', Paper presented at 13th International Conference on Learning Representations, ICLR 2025, Singapore, Singapore, 24/04/25 - 28/04/25 pp. 18387-18400.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:ris.utwente.nl:openaire/bf111143-ee07-4af0-82ff-694c5d8e32bc","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/bf111143-ee07-4af0-82ff-694c5d8e32bc","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Antoniadis, A, Eli\u00e1\u0161, M, Polak, A & Venzin, M 2024 'Approximation algorithms for combinatorial optimization with predictions' ArXiv.org, pp. 18387-18400. https://doi.org/10.48550/arXiv.2411.16600","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2411.16600","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2411.16600","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2411.16600","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2411.16600","pdf_url":"https://arxiv.org/pdf/2411.16600","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4508289328","display_name":null,"funder_award_id":"PE00000013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4404987915.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596"],"abstract_inverted_index":{"We":[0,21,160],"initiate":[1],"a":[2,23,27,37,134,138],"systematic":[3,24],"study":[4],"of":[5,13,30,40,43,114,116,131,145,166],"utilizing":[6],"predictions":[7,76,101],"to":[8,35,125,148],"improve":[9],"over":[10],"approximation":[11,79,94],"guarantees":[12,95],"classic":[14],"algorithms,":[15],"without":[16,100],"increasing":[17,84],"the":[18,103,110,117,156],"running":[19],"time.":[20],"propose":[22],"method":[25],"for":[26,128,140],"wide":[28],"class":[29,130],"optimization":[31],"problems":[32,132,147],"that":[33,96],"ask":[34],"select":[36],"feasible":[38],"subset":[39],"input":[41],"items":[42],"minimal":[44],"(or":[45],"maximal)":[46],"total":[47],"weight.":[48],"This":[49],"gives":[50],"simple":[51],"(near-)linear":[52],"time":[53,105],"algorithms":[54,68],"for,":[55],"e.g.,":[56],"Vertex":[57],"Cover,":[58],"Steiner":[59,157],"Tree,":[60],"Min-Weight":[61],"Perfect":[62],"Matching,":[63],"Knapsack,":[64],"and":[65,77,112],"Clique.":[66],"Our":[67],"produce":[69],"optimal":[70,127],"solutions":[71],"when":[72],"provided":[73],"with":[74,83,162],"perfect":[75],"their":[78],"ratios":[80],"smoothly":[81],"degrade":[82],"prediction":[85,90],"error.":[86],"With":[87],"small":[88],"enough":[89],"error":[91],"we":[92,121,152],"achieve":[93],"are":[97],"beyond":[98],"reach":[99],"in":[102],"given":[104],"bounds,":[106],"as":[107,133],"exemplified":[108],"by":[109],"NP-hardness":[111],"APX-hardness":[113],"many":[115],"above":[118],"problems.":[119],"Although":[120],"show":[122],"our":[123,167],"approach":[124],"be":[126],"this":[129,154],"whole,":[135],"there":[136],"is":[137],"potential":[139],"exploiting":[141],"specific":[142],"structural":[143],"properties":[144],"individual":[146],"obtain":[149],"improved":[150],"bounds;":[151],"demonstrate":[153],"on":[155],"Tree":[158],"problem.":[159],"conclude":[161],"an":[163],"empirical":[164],"evaluation":[165],"approach.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-18T07:39:51.176621","created_date":"2025-10-10T00:00:00"}