×

Found 18 Documents (Results 1–18)

Probabilistic analysis of Euclidean capacitated vehicle routing. (English) Zbl 07788616

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 43, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A simple algorithm for graph reconstruction. (English) Zbl 07740923

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 68, 18 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

A \((5/3+\varepsilon)\)-approximation for unsplittable flow on a path: placing small tasks into boxes. (English) Zbl 1422.68298

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 607-619 (2018).
PDFBibTeX XMLCite
Full Text: DOI

Optimization of bootstrapping in circuits. (English) Zbl 1409.68089

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2423-2433 (2017).
MSC:  68P25 94A60
PDFBibTeX XMLCite
Full Text: DOI arXiv

To augment or not to augment: solving unsplittable flow on a path by creating slack. (English) Zbl 1411.68188

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2411-2422 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Correlation clustering and two-edge-connected augmentation for planar graphs. (English) Zbl 1355.68207

Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 554-567 (2015).
PDFBibTeX XMLCite
Full Text: DOI

Near-linear query complexity for graph inference. (English) Zbl 1440.68124

Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 773-784 (2015).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs. (English) Zbl 1329.05282

Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 141-151 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Graph reconstruction via distance oracles. (English) Zbl 1336.68203

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 733-744 (2013).
MSC:  68R10 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

Software