×

Found 965 Documents (Results 1–100)

Better and simpler learning-augmented online caching. (English) Zbl 07758362

Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 60, 17 p. (2020).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Certified algorithms: worst-case analysis and beyond. (English) Zbl 07650397

Vidick, Thomas (ed.), 11th innovations in theoretical computer science conference, ITCS 2020, Seattle, Washington, USA, January 12–14, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 151, Article 49, 14 p. (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

An improved approximation algorithm for the coupled-task scheduling problem with equal exact delays. (English) Zbl 1460.90082

Kononov, Alexander (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12095, 265-273 (2020).
MSC:  90B35 68W25
PDFBibTeX XMLCite
Full Text: DOI

A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem. (English) Zbl 1460.90147

Kochetov, Yury (ed.) et al., Mathematical optimization theory and operations research. 19th international conference, MOTOR 2020, Novosibirsk, Russia, July 6–10, 2020. Revised selected papers. Cham: Springer. Commun. Comput. Inf. Sci. 1275, 3-15 (2020).
MSC:  90C27 90C35
PDFBibTeX XMLCite
Full Text: DOI

Planted models for \(k\)-way edge and vertex expansion. (English) Zbl 07650320

Chattopadhyay, Arkadev (ed.) et al., 39th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2019, Bombay, India, December 11–13, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 150, Article 23, 15 p. (2019).
MSC:  68N30 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. (English) Zbl 07559355

Quinton, Sophie (ed.), 31st Euromicro conference on real-time systems, ECRTS 2019, Stuttgart, Germany, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 133, Article 21, 23 p. (2019).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: DOI

Bilu-Linial stability, certified algorithms and the independent set problem. (English) Zbl 07525444

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 7, 16 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Perturbation resilient clustering for k-center and related problems via LP relaxations. (English) Zbl 1521.68269

Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 9, 16 p. (2018).
MSC:  68W40 62H30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Semi-random graphs with planted sparse vertex cuts: algorithms for exact and approximate recovery. (English) Zbl 1499.68285

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 101, 15 p. (2018).
MSC:  68R10 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier. (English) Zbl 1499.68261

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 33, 14 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

A response-time analysis for non-preemptive job sets under global scheduling. (English) Zbl 1497.68067

Altmeyer, Sebastian (ed.), 30th Euromicro conference on real-time systems, ECRTS 2018, July 3rd–6th, 2018, Barcelona, Spain. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 106, Article 9, 23 p. (2018).
MSC:  68M20
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software