{"id":"https://openalex.org/W7138103851","doi":"https://doi.org/10.1137/25m1759902","title":"Improved Approximation Algorithms for the Expanding Search Problem","display_name":"Improved Approximation Algorithms for the Expanding Search Problem","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138103851","doi":"https://doi.org/10.1137/25m1759902"},"language":"en","primary_location":{"id":"doi:10.1137/25m1759902","is_oa":false,"landing_page_url":"https://doi.org/10.1137/25m1759902","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Svenja M. Griesbach","orcid":"https://orcid.org/0000-0001-8018-3289"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Svenja M. Griesbach","raw_affiliation_strings":["Faculty of Computer Science, RWTH Aachen University, Aachen, Germany; Centro de Modelamiento Matem\u00e1tico CNRS IRL2807Universidad de Chile, Santiago, Chile"],"raw_orcid":"https://orcid.org/0000-0001-8018-3289","affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, RWTH Aachen University, Aachen, Germany; Centro de Modelamiento Matem\u00e1tico CNRS IRL2807Universidad de Chile, Santiago, Chile","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Felix Hommelsheim","orcid":"https://orcid.org/0000-0003-4444-9793"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Felix Hommelsheim","raw_affiliation_strings":["University of Cologne, Department of Mathematics and Computer Science, Cologne, Germany; Universit\u00e4t Bremen, Faculty of Mathematics and Computer Science, Bremen, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4444-9793","affiliations":[{"raw_affiliation_string":"University of Cologne, Department of Mathematics and Computer Science, Cologne, Germany; Universit\u00e4t Bremen, Faculty of Mathematics and Computer Science, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Max Klimm","orcid":"https://orcid.org/0000-0002-9061-2267"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Max Klimm","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Institute for Mathematics, Berlin, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9061-2267","affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Institute for Mathematics, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":null,"display_name":"Kevin Schewior","orcid":"https://orcid.org/0000-0003-2236-0210"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kevin Schewior","raw_affiliation_strings":["University of Cologne, Department of Mathematics and Computer Science, Cologne, Germany; University of Southern Denmark, Department of Mathematics and Computer Science, Odense, Denmark"],"raw_orcid":"https://orcid.org/0000-0003-2236-0210","affiliations":[{"raw_affiliation_string":"University of Cologne, Department of Mathematics and Computer Science, Cologne, Germany; University of Southern Denmark, Department of Mathematics and Computer Science, Odense, Denmark","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57947316,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"1","first_page":"349","last_page":"373"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.27480000257492065,"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.27480000257492065,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.1396999955177307,"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/T12288","display_name":"Optimization and Search Problems","score":0.08540000021457672,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.65829998254776},{"id":"https://openalex.org/keywords/hardness-of-approximation","display_name":"Hardness of approximation","score":0.36340001225471497},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.33730000257492065},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.31929999589920044},{"id":"https://openalex.org/keywords/stochastic-approximation","display_name":"Stochastic approximation","score":0.31850001215934753},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.3138999938964844}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.65829998254776},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6570000052452087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4381999969482422},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39579999446868896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37959998846054077},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.36340001225471497},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.362199991941452},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.33730000257492065},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.31929999589920044},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.31850001215934753},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.3138999938964844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28850001096725464},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2847000062465668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2689000070095062},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.25940001010894775}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/25m1759902","is_oa":false,"landing_page_url":"https://doi.org/10.1137/25m1759902","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G422837754","display_name":null,"funder_award_id":"DFF-0135-00018B","funder_id":"https://openalex.org/F4320322928","funder_display_name":"Danmarks Frie Forskningsfond"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"},{"id":"https://openalex.org/F4320324811","display_name":"Universit\u00e4t zu K\u00f6ln","ror":"https://ror.org/00rcxh774"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W80909727","https://openalex.org/W302937848","https://openalex.org/W1482405521","https://openalex.org/W1492330513","https://openalex.org/W1531274257","https://openalex.org/W1569458199","https://openalex.org/W1966793805","https://openalex.org/W1967613325","https://openalex.org/W1969925267","https://openalex.org/W1988770656","https://openalex.org/W1991678853","https://openalex.org/W1995284651","https://openalex.org/W2009279347","https://openalex.org/W2013679020","https://openalex.org/W2020931444","https://openalex.org/W2031458380","https://openalex.org/W2038190710","https://openalex.org/W2062238337","https://openalex.org/W2062962786","https://openalex.org/W2070664846","https://openalex.org/W2077042172","https://openalex.org/W2084046657","https://openalex.org/W2086917808","https://openalex.org/W2087281053","https://openalex.org/W2093376706","https://openalex.org/W2104454324","https://openalex.org/W2111697972","https://openalex.org/W2115556222","https://openalex.org/W2148352980","https://openalex.org/W2165142526","https://openalex.org/W2168881041","https://openalex.org/W2770602782","https://openalex.org/W2884839953","https://openalex.org/W2963470234","https://openalex.org/W2964340177","https://openalex.org/W3134639002","https://openalex.org/W3207977933","https://openalex.org/W4233139652","https://openalex.org/W4249302711"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-20T20:47:17.329874","created_date":"2025-10-10T00:00:00"}