×

Found 452 Documents (Results 1–100)

Lower bounds on the performance of online algorithms for relaxed packing problems. (English) Zbl 07577693

Bazgan, Cristina (ed.) et al., Combinatorial algorithms. 33rd international workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13270, 101-113 (2022).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Fractionally subadditive maximization under an incremental knapsack constraint. (English) Zbl 07603893

Koenemann, Jochen (ed.) et al., Approximation and online algorithms. 19th international workshop, WAOA 2021, Lisbon, Portugal, September 6–10, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12982, 206-223 (2021).
MSC:  68W25 68W27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Semi-online early work maximization problem on two hierarchical machines with partial information of processing time. (English) Zbl 07551681

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 146-156 (2021).
MSC:  90B35 68W27
PDF BibTeX XML Cite
Full Text: DOI

An online algorithm for data caching problem in edge computing. (English) Zbl 07551675

Wu, Weili (ed.) et al., Algorithmic aspects in information and management. 15th international conference, AAIM 2021, virtual event, December 20–22, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13153, 71-80 (2021).
MSC:  68W27 68M14 68M20
PDF BibTeX XML Cite
Full Text: DOI

Robust online algorithms for dynamic choosing problems. (English) Zbl 07495154

De Mol, Liesbeth (ed.) et al., Connecting with computability. 17th conference on computability in Europe, CiE 2021, virtual event, Ghent, Belgium, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12813, 38-49 (2021).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

The pony express communication problem. (English) Zbl 07495024

Flocchini, Paola (ed.) et al., Combinatorial algorithms. 32nd international workshop, IWOCA 2021, Ottawa, ON, Canada, July 5–7, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12757, 208-222 (2021).
MSC:  68Rxx 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Semi-online algorithms for hierarchical scheduling on three parallel machines with a buffer size of 1. (English) Zbl 1481.68049

He, Kun (ed.) et al., Theoretical computer science. 38th national conference, NCTCS 2020, Nanning, China, November 13–15, 2020. Revised selected papers. Singapore: Springer. Commun. Comput. Inf. Sci. 1352, 47-56 (2021).
MSC:  68W27 90B35
PDF BibTeX XML Cite
Full Text: DOI

Online BP functions maximization. (English) Zbl 1482.68278

Zhang, Zhao (ed.) et al., Algorithmic aspects in information and management. 14th international conference, AAIM 2020, Jinhua, China, August 10–12, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12290, 173-184 (2020).
MSC:  68W27 68W25 90C59
PDF BibTeX XML Cite
Full Text: DOI

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. Lect. Notes Comput. Sci. 11926, 43-59 (2020).
MSC:  68W25 68W27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Linear rendezvous with asymmetric clocks. (English) Zbl 07561453

Cao, Jiannong (ed.) et al., 22nd international conference on principles of distributed systems, OPODIS 2018, December 17–19, 2018, Hong Kong, China. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 125, Article 25, 16 p. (2019).
MSC:  68M14 68M20
PDF BibTeX XML Cite
Full Text: DOI

Tight analysis of the smartstart algorithm for online dial-a-ride on the line. (English) Zbl 07559124

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 15, 17 p. (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Bayesian generalized network design. (English) Zbl 07525482

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 45, 16 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

Online bin covering with limited migration. (English) Zbl 07525455

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 18, 14 p. (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Symmetry breaking in the plane. Rendezvous by robots with unknown attributes. (English) Zbl 07298649

Nowak, Thomas (ed.), Proceedings of the 38th ACM symposium on principles of distributed computing, PODC ’19, Toronto, ON, Canada, July 29 – August 2, 2019. New York, NY: Association for Computing Machinery (ACM). 4-13 (2019).
MSC:  68M14 68W15
PDF BibTeX XML Cite
Full Text: DOI

Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs. (English) Zbl 1452.68031

Sun, Xiaoming (ed.) et al., Theoretical computer science. 37th national conference, NCTCS 2019, Lanzhou, China, August 2–4, 2019. Revised selected papers. Singapore: Springer. Commun. Comput. Inf. Sci. 1069, 95-108 (2019).
MSC:  68M20 68W27
PDF BibTeX XML Cite
Full Text: DOI

Dynamic set cover: improved algorithms and lower bounds. (English) Zbl 1433.68616

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 114-125 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Online travelling salesman problem on a circle. (English) Zbl 07117285

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 15th annual conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11436, 325-336 (2019).
MSC:  68Q05
PDF BibTeX XML Cite
Full Text: DOI

Online maximum matching with recourse. (English) Zbl 07378325

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 8, 15 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Scheduling with explorable uncertainty. (English) Zbl 1462.90049

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 30, 14 p. (2018).
MSC:  90B35 68W20 68W27
PDF BibTeX XML Cite
Full Text: DOI

Intractability issues in mixed-criticality scheduling. (English) Zbl 07286768

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 11, 21 p. (2018).
MSC:  68M20 68Q17 68Q25
PDF BibTeX XML Cite
Full Text: DOI

Online unit covering in Euclidean space. (English) Zbl 1436.68379

Kim, Donghyun (ed.) et al., Combinatorial optimization and applications. 12th international conference, COCOA 2018, Atlanta, GA, USA, December 15–17, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11346, 609-623 (2018).
MSC:  68U05 68W27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software