{"id":"https://openalex.org/W7134242528","doi":"https://doi.org/10.1137/24m1657833","title":"Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride","display_name":"Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride","publication_year":2026,"publication_date":"2026-03-09","ids":{"openalex":"https://openalex.org/W7134242528","doi":"https://doi.org/10.1137/24m1657833"},"language":"en","primary_location":{"id":"doi:10.1137/24m1657833","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1657833","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":"https://openalex.org/A5018668283","display_name":"J\u00falia Balig\u00e1cs","orcid":"https://orcid.org/0000-0003-2654-149X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J\u00falia Balig\u00e1cs","raw_affiliation_strings":["TU Darmstadt, Darmstadt, 64293 Germany"],"raw_orcid":"https://orcid.org/0000-0003-2654-149X","affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, 64293 Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021248592","display_name":"Yann Disser","orcid":"https://orcid.org/0000-0002-2085-0454"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Yann Disser","raw_affiliation_strings":["TU Darmstadt, Darmstadt, 64293 Germany"],"raw_orcid":"https://orcid.org/0000-0002-2085-0454","affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, 64293 Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036291098","display_name":"Nils Mosis","orcid":"https://orcid.org/0000-0002-0692-0647"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nils Mosis","raw_affiliation_strings":["TU Darmstadt, Darmstadt, 64293 Germany"],"raw_orcid":"https://orcid.org/0000-0002-0692-0647","affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, 64293 Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025813704","display_name":"David Weckbecker","orcid":"https://orcid.org/0000-0003-3381-058X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technische Universit\u00e4t Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"David Weckbecker","raw_affiliation_strings":["TU Darmstadt, Darmstadt, 64293 Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Darmstadt, Darmstadt, 64293 Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5018668283"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.41883962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"1","first_page":"260","last_page":"281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.849399983882904,"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/T12288","display_name":"Optimization and Search Problems","score":0.849399983882904,"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.014000000432133675,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.009100000374019146,"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/online-algorithm","display_name":"Online algorithm","score":0.4174000024795532},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3319000005722046},{"id":"https://openalex.org/keywords/analysis-of-algorithms","display_name":"Analysis of algorithms","score":0.3116999864578247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.27790001034736633},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.2621999979019165}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5587999820709229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5521000027656555},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4196000099182129},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4174000024795532},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3912999927997589},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3912000060081482},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35530000925064087},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3319000005722046},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.25850000977516174},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/24m1657833","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1657833","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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1490508940","https://openalex.org/W1531600130","https://openalex.org/W1570617517","https://openalex.org/W1722876370","https://openalex.org/W1989571340","https://openalex.org/W1995561145","https://openalex.org/W2046731583","https://openalex.org/W2098465634","https://openalex.org/W2101894691","https://openalex.org/W2111697972","https://openalex.org/W2113529358","https://openalex.org/W2124636690","https://openalex.org/W2129260095","https://openalex.org/W2130999390","https://openalex.org/W2132632316","https://openalex.org/W2135307460","https://openalex.org/W2159448554","https://openalex.org/W2165780346","https://openalex.org/W2936933987","https://openalex.org/W2954136843","https://openalex.org/W3036408378","https://openalex.org/W4307416759","https://openalex.org/W4385317077"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2026-03-10T00:00:00"}