×

zbMATH — the first resource for mathematics

Found 2,389 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Hrga, Timotej; Lužar, Borut; Povh, Janez; Wiegele, Angelika
BiqBin: moving boundaries for NP-hard problems by HPC. (English) Zbl 1440.90061
Dimov, Ivan (ed.) et al., Advances in high performance computing. Results of the international conference on high performance computing, Borovets, Bulgaria, September 2–6, 2019. Cham: Springer. Stud. Comput. Intell. 902, 327-339 (2021).
MSC:  90C27 65K05 65Y10 68Q17 90C57
PDF BibTeX XML Cite
\textit{T. Hrga} et al., Stud. Comput. Intell. 902, 327--339 (2021; Zbl 1440.90061)
Full Text: DOI
Pacut, Maciej; Parham, Mahmoud; Schmid, Stefan
Brief announcement: Deterministic lower bound for dynamic balanced graph partitioning. (English) Zbl 07323222
Cachin, Christian (ed.) et al., Proceedings of the 39th ACM symposium on principles of distributed computing, PODC ’20, virtual event, August 3–7, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-7582-5). 461-463 (2020).
MSC:  68M14 68W15
PDF BibTeX XML Cite
\textit{M. Pacut} et al., in: Proceedings of the 39th ACM symposium on principles of distributed computing, PODC '20, virtual event, August 3--7, 2020. New York, NY: Association for Computing Machinery (ACM). 461--463 (2020; Zbl 07323222)
Full Text: DOI
Bienkowski, Marcin; Byrka, Jarosław; Coester, Christian; Jeż, Łukasz
Unbounded lower bound for \(k\)-server against weak adversaries. (English) Zbl 07298318
Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1165-1169 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{M. Bienkowski} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1165--1169 (2020; Zbl 07298318)
Full Text: DOI
Gupta, Anupam; Kumar, Amit; Panigrahi, Debmalya
Caching with time windows. (English) Zbl 07298315
Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 1125-1138 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{A. Gupta} et al., in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 1125--1138 (2020; Zbl 07298315)
Full Text: DOI
Bampis, Evripidis; Megow, Nicole
Correction to: approximation and online algorithms. (English) Zbl 07238571
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, C1 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{E. Bampis} and \textit{N. Megow}, Lect. Notes Comput. Sci. 11926, C1 (2020; Zbl 07238571)
Full Text: DOI
Schmidt, Melanie; Schwiegelshohn, Chris; Sohler, Christian
Fair coresets and streaming algorithms for fair \(k\)-means. (English) Zbl 07238570
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 232-251 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{M. Schmidt} et al., Lect. Notes Comput. Sci. 11926, 232--251 (2020; Zbl 07238570)
Full Text: DOI
Liu, Fu-Hong; Liu, Hsiang-Hsuan; Wong, Prudence W. H.
Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs. (English) Zbl 07238569
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 217-231 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{F.-H. Liu} et al., Lect. Notes Comput. Sci. 11926, 217--231 (2020; Zbl 07238569)
Full Text: DOI
Katsikarelis, Ioannis; Lampis, Michael; Paschos, Vangelis Th.
Improved (In-)approximability bounds for \(d\)-scattered set. (English) Zbl 07238568
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 202-216 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{I. Katsikarelis} et al., Lect. Notes Comput. Sci. 11926, 202--216 (2020; Zbl 07238568)
Full Text: DOI
Inamdar, Tanmay; Varadarajan, Kasturi
Fault tolerant clustering with outliers. (English) Zbl 07238567
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 188-201 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{T. Inamdar} and \textit{K. Varadarajan}, Lect. Notes Comput. Sci. 11926, 188--201 (2020; Zbl 07238567)
Full Text: DOI
Happach, Felix; Schulz, Andreas S.
Precedence-constrained scheduling and min-sum set cover (extended Abstract). (English) Zbl 07238566
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 170-187 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{F. Happach} and \textit{A. S. Schulz}, Lect. Notes Comput. Sci. 11926, 170--187 (2020; Zbl 07238566)
Full Text: DOI
Grelier, Nicolas; De Joannis De Verclos, Rémi; Kang, Ross J.; Pirot, François
Approximate strong edge-colouring of unit disk graphs. (English) Zbl 07238565
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 154-169 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{N. Grelier} et al., Lect. Notes Comput. Sci. 11926, 154--169 (2020; Zbl 07238565)
Full Text: DOI
Gálvez, Waldo; Grandoni, Fabrizio; Ameli, Afrouz Jabal; Sornat, Krzysztof
On the Cycle Augmentation Problem: hardness and approximation algorithms. (English) Zbl 07238564
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 138-153 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{W. Gálvez} et al., Lect. Notes Comput. Sci. 11926, 138--153 (2020; Zbl 07238564)
Full Text: DOI
Feldkord, Björn; Knollmann, Till; Malatyali, Manuel; Meyer Auf Der Heide, Friedhelm
Managing multiple mobile resources. (English) Zbl 07238563
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 120-137 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{B. Feldkord} et al., Lect. Notes Comput. Sci. 11926, 120--137 (2020; Zbl 07238563)
Full Text: DOI
Fekete, Sándor P.; Grosse-Holz, Jonas; Keldenich, Phillip; Schmidt, Arne
Parallel online algorithms for the Bin Packing Problem. (English) Zbl 07238562
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 106-119 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{S. P. Fekete} et al., Lect. Notes Comput. Sci. 11926, 106--119 (2020; Zbl 07238562)
Full Text: DOI
Däubel, Karl
An improved upper bound for the Ring Loading Problem. (English) Zbl 07238561
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 89-105 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{K. Däubel}, Lect. Notes Comput. Sci. 11926, 89--105 (2020; Zbl 07238561)
Full Text: DOI
Cormode, Graham; Veselý, Pavel
Streaming algorithms for bin packing and vector scheduling. (English) Zbl 07238560
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 72-88 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{G. Cormode} and \textit{P. Veselý}, Lect. Notes Comput. Sci. 11926, 72--88 (2020; Zbl 07238560)
Full Text: DOI
Bougeret, Marin; Jansen, Klaus; Poss, Michael; Rohwedder, Lars
Approximation results for makespan minimization with budgeted uncertainty. (English) Zbl 07238559
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 60-71 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{M. Bougeret} et al., Lect. Notes Comput. Sci. 11926, 60--71 (2020; Zbl 07238559)
Full Text: DOI
Berndt, Sebastian; Dreismann, Valentin; Grage, Kilian; Jansen, Klaus; Knof, Ingmar
Robust online algorithms for certain dynamic packing problems. (English) Zbl 07238558
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 43-59 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{S. Berndt} et al., Lect. Notes Comput. Sci. 11926, 43--59 (2020; Zbl 07238558)
Full Text: DOI
Bergé, Pierre; Salaün, Lou
Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts. (English) Zbl 07238557
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 29-42 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{P. Bergé} and \textit{L. Salaün}, Lect. Notes Comput. Sci. 11926, 29--42 (2020; Zbl 07238557)
Full Text: DOI
Balogh, János; Békési, József; Dósa, György; Epstein, Leah; Levin, Asaf
A new lower bound for classic online bin packing. (English) Zbl 07238556
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 18-28 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{J. Balogh} et al., Lect. Notes Comput. Sci. 11926, 18--28 (2020; Zbl 07238556)
Full Text: DOI
Ashur, Stav; Filtser, Omrit; Katz, Matthew J.; Saban, Rachel
Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains. (English) Zbl 07238555
Bampis, Evripidis (ed.) et al., Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). Lecture Notes in Computer Science 11926, 1-17 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
\textit{S. Ashur} et al., Lect. Notes Comput. Sci. 11926, 1--17 (2020; Zbl 07238555)
Full Text: DOI
Csirik, J.; Dósa, Gy.; Kószó, D.
Online scheduling with machine cost and a quadratic objective function. (English) Zbl 1440.68338
Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 199-210 (2020).
MSC:  68W27 68W40 90B35
PDF BibTeX XML Cite
\textit{J. Csirik} et al., Lect. Notes Comput. Sci. 12011, 199--210 (2020; Zbl 1440.68338)
Full Text: DOI
Bampis, Evripidis (ed.); Megow, Nicole (ed.)
Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12–13, 2019. Revised selected papers. (English) Zbl 1435.68018
Lecture Notes in Computer Science 11926. Cham: Springer (ISBN 978-3-030-39478-3/pbk; 978-3-030-39479-0/ebook). xii, 253 p. (2020).
MSC:  68-06 68W25 68W27 00B25
PDF BibTeX XML Cite
\textit{E. Bampis} (ed.) and \textit{N. Megow} (ed.), Approximation and online algorithms. 17th international workshop, WAOA 2019, Munich, Germany, September 12--13, 2019. Revised selected papers. Cham: Springer (2020; Zbl 1435.68018)
Full Text: DOI

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Serial
all top 5
Year of Publication
all top 3
Classification
all top 3
Software