[{"das_tickbox":"0","OA_type":"gold","external_id":{"arxiv":["2604.24134"]},"keyword":["Data structures","graph algorithms","amortized analysis"],"file":[{"file_id":"22949","content_type":"application/pdf","checksum":"52e7cb8881060e8f17b89cd46504f445","date_created":"2026-09-17T10:33:12Z","file_size":792024,"date_updated":"2026-09-17T10:33:12Z","file_name":"2026_LIPIcsESA_vanderHoog2.pdf","success":1,"creator":"dernst","relation":"main_file","access_level":"open_access"}],"arxiv":1,"author":[{"full_name":"Van Der Hoog, Ivor","first_name":"Ivor","last_name":"Van Der Hoog"},{"first_name":"John","last_name":"Iacono","full_name":"Iacono, John"},{"last_name":"Rotenberg","first_name":"Eva","full_name":"Rotenberg, Eva"},{"first_name":"Daniel P","last_name":"Rutschmann","id":"7397d908-b582-11f0-bf73-88b902e86527","full_name":"Rutschmann, Daniel P"}],"day":"25","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","file_date_updated":"2026-09-17T10:33:12Z","researchdata_availability":"no","date_updated":"2026-09-17T10:35:56Z","fulldoi":"https://doi.org/10.4230/LIPIcs.ESA.2026.45","supplementarymaterial":"no","month":"08","has_accepted_license":"1","title":"Near-optimal working-set heaps and dijkstra on pointer machines","OA_place":"publisher","date_created":"2026-09-13T22:01:53Z","publication":"34th Annual European Symposium on Algorithms","scopus_import":"1","department":[{"_id":"MoHe"}],"oa":1,"article_number":"45:1-45:13","article_processing_charge":"Yes","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2026","status":"public","date_published":"2026-08-25T00:00:00Z","_id":"22917","alternative_title":["LIPIcs"],"acknowledgement":"Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann thank the VILLUM Foundation\r\ngrant (VIL37507) “Efficient Recomputations for Changeful Problems” for supporting this work.\r\nDaniel Rutschmann is supported by the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (No. 101019564) . John Iacono\r\nis supported by the Fonds de la Recherche Scientifique – FNRS.This work started at Dagstuhl 25191: Adaptive and Scalable Data Structures.\r\n\r\n","doi":"10.4230/LIPIcs.ESA.2026.45","volume":388,"quality_controlled":"1","abstract":[{"text":"A heap is a dynamic data structure that stores a set of labeled values under the following operations: pop returns the minimum value of the heap, Push(x_i) pushes a new value x_i onto the heap, and DecreaseKey(i, v) decreases the value x_i to v. A working-set heap is a heap that supports the x_i ← pop() operation in O(log Γ(x_i)) time where Γ(x_i) is the size of the working set: the number of elements that were pushed onto the heap while x_i was in the heap. The goal of working set heap design is to maintain the working set property while minimizing the overhead of the Push and DecreaseKey operations. On a word RAM, there exist working set heaps that support Push and DecreaseKey in amortized constant time. In this paper, we show via a simple construction that pointer machines, one of the most general and least-assuming computational models, support working set heaps that support Push in amortized constant time and DecreaseKey in inverse-Ackermann time. A by-product of this analysis is that Dijkstra’s shortest path algorithm can be near-universally optimal on a pointer machine - incurring only an additive O(m α(m)) overhead compared to the optimal running time for distance ordering, where m denotes the number of edges in the graph.","lang":"eng"}],"corr_author":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":"       388","conference":{"location":"L’Aquila, Italy","end_date":"2026-09-04","start_date":"2026-08-31","name":"ESA: European Symposium on Algorithms"},"citation":{"ista":"Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. 2026. Near-optimal working-set heaps and dijkstra on pointer machines. 34th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 45:1-45:13.","short":"I. Van Der Hoog, J. Iacono, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","apa":"Van Der Hoog, I., Iacono, J., Rotenberg, E., &#38; Rutschmann, D. P. (2026). Near-optimal working-set heaps and dijkstra on pointer machines. In <i>34th Annual European Symposium on Algorithms</i> (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.45\">https://doi.org/10.4230/LIPIcs.ESA.2026.45</a>","ama":"Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. Near-optimal working-set heaps and dijkstra on pointer machines. In: <i>34th Annual European Symposium on Algorithms</i>. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.45\">10.4230/LIPIcs.ESA.2026.45</a>","chicago":"Van Der Hoog, Ivor, John Iacono, Eva Rotenberg, and Daniel P Rutschmann. “Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.” In <i>34th Annual European Symposium on Algorithms</i>, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.45\">https://doi.org/10.4230/LIPIcs.ESA.2026.45</a>.","mla":"Van Der Hoog, Ivor, et al. “Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.” <i>34th Annual European Symposium on Algorithms</i>, vol. 388, 45:1-45:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2026.45\">10.4230/LIPIcs.ESA.2026.45</a>.","ieee":"I. Van Der Hoog, J. Iacono, E. Rotenberg, and D. P. Rutschmann, “Near-optimal working-set heaps and dijkstra on pointer machines,” in <i>34th Annual European Symposium on Algorithms</i>, L’Aquila, Italy, 2026, vol. 388."},"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774451"]},"publication_status":"published","ec_funded":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"}]