×

Found 20 Documents (Results 1–20)

Compact distance oracles with large sensitivity and low stretch. (English) Zbl 07789702

Morin, Pat (ed.) et al., Algorithms and data structures. 18th international symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14079, 149-163 (2023).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

New approximation algorithms for the heterogeneous weighted delivery problem. (English) Zbl 07495139

Jurdziński, Tomasz (ed.) et al., Structural information and communication complexity. 28th international colloquium, SIROCCO 2021, Wrocław, Poland, June 28 – July 1, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12810, 167-184 (2021).
MSC:  68Mxx 68Q11 68R10
PDFBibTeX XMLCite
Full Text: DOI

On the tree conjecture for the network creation game. (English) Zbl 1487.91017

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 14, 15 p. (2018).
MSC:  91A43 91A68 05C90
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient oracles and routing schemes for replacement paths. (English) Zbl 1487.68051

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 13, 15 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

An improved algorithm for computing all the best swap edges of a tree spanner. (English) Zbl 1457.68205

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 14, 13 p. (2017).
MSC:  68R10 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

A faster computation of all the best swap edges of a tree spanner. (English) Zbl 1471.68186

Scheideler, Christian (ed.), Structural information and communication complexity. 22nd international colloquium, SIROCCO 2015, Montserrat, Spain, July 14–16, 2015. Post-proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9439, 239-253 (2015).
MSC:  68R10 68M15 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Improved purely additive fault-tolerant spanners. (English) Zbl 1465.68205

Bansal, Nikhil (ed.) et al., Algorithms – ESA 2015. 23rd annual European symposium, Patras, Greece, September 14–16, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9294, 167-178 (2015).
MSC:  68R10 05C12 68M15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Exact and approximate algorithms for movement problems on (special classes of) graphs. (English) Zbl 1353.68254

Moscibroda, Thomas (ed.) et al., Structural information and communication complexity. 20th international colloquium, SIROCCO 2013, Ischia, Italy, July 1–3, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-319-03577-2/pbk). Lecture Notes in Computer Science 8179, 322-333 (2013).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Approximating the metric TSP in linear time. (English) Zbl 1202.90259

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 43-54 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software