Search Results - "Theory of computation → Online algorithms"

Contributors: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA), ANR-21-CE48-0004,GRALMECO,Algorithmique des problèmes de couverture métriques dans les graphes(2021), ANR-16-IDEX-0001,CAP 20-25,CAP 20-25(2016)

Source: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs)
Mathematical Foundations of Computer Science (MFCS)
https://hal.science/hal-04818742
Mathematical Foundations of Computer Science (MFCS), Aug 2024, Bratislava, Slovakia. pp.1-16, ⟨10.4230/LIPIcs.MFCS.2024.19⟩

Subject Terms: 2012 ACM Subject Classification Theory of computation → Online algorithms Theory of computation → Graph algorithms analysis Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Online algorithms, Competitive analysis, Outerplanar graphs, 2012 ACM Subject Classification Theory of computation → Online algorithms, Theory of computation → Graph algorithms analysis, Mathematics of computing → Graph algorithms phrases Canadian Traveller Problem, Canadian Traveller Problem, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Subject Geographic: Bratislava, Slovakia

Availability: https://hal.science/hal-04818742
https://hal.science/hal-04818742v1/document
https://hal.science/hal-04818742v1/file/LIPIcs.MFCS.2024.19.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2024.19

View record from BASE

4

Conference

Online Simple Knapsack with Bounded Predictions

Authors: Gehnen, Matthias, Lotze, Henri, Rossmanith, Peter

Contributors: Matthias Gehnen and Henri Lotze and Peter Rossmanith

Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 20 pages (2024). doi:10.4230/LIPICS.STACS.2024.37
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14

Subject Terms: Simple Knapsack, Predictions, Online problem, Machine-Learned Advice, ddc:004, Theory of computation → Online algorithms

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.37
https://publications.rwth-aachen.de/record/995075

View record at OpenAIRE

5

Conference

Collective Tree Exploration via Potential Function Method

Authors: Cosson, Romain, Massoulié, Laurent

Contributors: Apprentissage, graphes et optimisation distribuée (ARGO), Département d'informatique - ENS-PSL (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), Dynamics of Geometric Networks (DYOGENE), ANR-19-P3IA-0001,PRAIRIE,PaRis Artificial Intelligence Research InstitutE(2019)

Source: ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference ; https://hal.science/hal-04691075 ; ITCS 2024 - 15th Innovations in Theoretical Computer Science Conference, Jan 2024, Berkeley, CA, United States. ⟨10.4230/LIPIcs.ITCS.2024.35⟩

Subject Terms: Collective exploration, Online algorithms, Evolving tree, Competitive analysis, Theory of computation → Online algorithms, Mathematics of computing → Graph algorithms, [INFO]Computer Science [cs]

Subject Geographic: Berkeley, CA, United States

Availability: https://hal.science/hal-04691075
https://hal.science/hal-04691075v1/document
https://hal.science/hal-04691075v1/file/LIPIcs.ITCS.2024.35.pdf
https://doi.org/10.4230/LIPIcs.ITCS.2024.35

View record from BASE

6

Academic Journal

Best Fit Bin Packing with Random Order Revisited: Best fit bin packing with random order revisited

Authors: Susanne Albers, Arindam Khan, Leon Ladewig

Contributors: Susanne Albers and Arindam Khan and Leon Ladewig, Javier Esparza, Daniel Kráľ

Source: Algorithmica
45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)

Subject Terms: FOS: Computer and information sciences, Combinatorial optimization, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, probabilistic analysis, Theory of computation → Online algorithms, 01 natural sciences, Article, Computer Science - Data Structures and Algorithms, Online algorithms, streaming algorithms, Analysis of algorithms, Data Structures and Algorithms (cs.DS), Online bin packing, ddc:004, online bin packing, random arrival order

File Description: application/xml; application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s00453-021-00844-5.pdf
https://pubmed.ncbi.nlm.nih.gov/34776569
http://arxiv.org/abs/2012.00511
https://zbmath.org/7390203
https://doi.org/10.1007/s00453-021-00844-5
https://arxiv.org/abs/2012.00511
http://arxiv-export3.library.cornell.edu/abs/2012.00511v1
https://dblp.uni-trier.de/db/journals/corr/corr2012.html#abs-2012-00511
https://drops.dagstuhl.de/opus/volltexte/2020/12730/
https://drops.dagstuhl.de/opus/volltexte/2020/12730/pdf/LIPIcs-MFCS-2020-7.pdf/
https://link.springer.com/article/10.1007/s00453-021-00844-5
https://paperity.org/p/267042870/best-fit-bin-packing-with-random-order-revisited
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica83.html#AlbersKL21a
https://link.springer.com/content/pdf/10.1007/s00453-021-00844-5.pdf
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.7

View record at OpenAIRE View record at Springer

Linked Full Text

7

Academic Journal

Scheduling in the Random-Order Model

Authors: Susanne Albers, Maximilian Janke

Contributors: Susanne Albers and Maximilian Janke, Artur Czumaj, Anuj Dawar, Emanuela Merelli

Source: Algorithmica
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

Subject Terms: FOS: Computer and information sciences, Scheduling, makespan minimization, 0211 other engineering and technologies, random-order, 0102 computer and information sciences, 02 engineering and technology, Theory of computation → Online algorithms, 01 natural sciences, Article, ddc, online algorithm, 13. Climate action, Computer Science - Data Structures and Algorithms, competitive analysis, Data Structures and Algorithms (cs.DS), ddc:004, lower bound

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s00453-021-00841-8.pdf
https://pubmed.ncbi.nlm.nih.gov/34720298
http://arxiv.org/abs/2006.00386
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#AlbersJ20
https://doi.org/10.4230/LIPIcs.ICALP.2020.68
https://drops.dagstuhl.de/opus/volltexte/2020/12475/pdf/LIPIcs-ICALP-2020-68.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12475/
https://link.springer.com/article/10.1007/s00453-021-00841-8
https://link.springer.com/content/pdf/10.1007/s00453-021-00841-8.pdf
https://dblp.uni-trier.de/db/journals/corr/corr2006.html#abs-2006-00386
https://mediatum.ub.tum.de/1616856
https://link.springer.com/10.1007/s00453-021-00841-8
https://europepmc.org/article/MED/34720298
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.68
https://mediatum.ub.tum.de/doc/1616856/document.pdf

View record at OpenAIRE View record at Springer

Linked Full Text

8

Academic Journal

Competitive Data-Structure Dynamization

Authors: Claire Mathieu, Rajmohan Rajaraman, Neal E. Young, Arman Yousefi

Contributors: Mathieu, Claire

Source: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611976465

Subject Terms: FOS: Computer and information sciences, F.1.2, H.2.4, cs.DB, log-structured merge-tree, Information systems → Data management systems, 68P15, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, CCS Concepts, Computer Science - Databases, 68W27, 68P15, 68R05, data-structure dynamization, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, competitive analysis, Data Structures and Algorithms (cs.DS), compaction ACM Reference format, Applied computing → Enterprise computing infrastructures, Online algorithms, Databases (cs.DB), Theory of computation → Online algorithms, 68R05, 68W27, cs.DS

File Description: application/pdf

Access URL: https://epubs.siam.org/doi/pdf/10.1137/1.9781611976465.135
http://arxiv.org/abs/2011.02615
https://hal.science/hal-04778975v1/document
https://hal.science/hal-04778975v1
https://doi.org/10.1145/3672614
https://escholarship.org/uc/item/12d079zf

View record at OpenAIRE Full Text Finder

9

Conference

Learning-Augmented Online TSP on Rings, Trees, Flowers and (Almost) Everywhere Else

Authors: Bampis, Evripidis, Escoffier, Bruno, Gouleakis, Themis, Hahn, Niklas, Lakis, Kostas, Shahkarami, Golnoosh, Xefteris, Michalis

Contributors: Evripidis Bampis and Bruno Escoffier and Themis Gouleakis and Niklas Hahn and Kostas Lakis and Golnoosh Shahkarami and Michalis Xefteris, Hahn, Niklas, Li Gørtz, Inge, Farach-Colton, Martin, Puglisi, Simon J., Herman, Grzegorz

Source: Leibniz International Proceedings in Informatics (LIPIcs), 274
31st Annual European Symposium on Algorithms (ESA 2023)

Subject Terms: FOS: Computer and information sciences, Competitive analysis, Theory of computation → Design and analysis of algorithms, Online algorithms, TSP, Learning-augmented algorithms, Algorithms with predictions, [INFO] Computer Science [cs], Theory of computation → Online algorithms, Computer Science - Data Structures and Algorithms, Theory of computation → Parameterized complexity and exact algorithms, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/pdf; application/application/pdf

Access URL: http://arxiv.org/abs/2305.02169
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.12
https://hal.sorbonne-universite.fr/hal-04208875v1
https://doi.org/10.4230/lipics.esa.2023.12
http://hdl.handle.net/20.500.11850/637196

View record at OpenAIRE

10

Academic Journal

Rényi-Ulam Games and Online Computation with Imperfect Advice

Authors: Angelopoulos, Spyros, Kamali, Shahin

Contributors: Spyros Angelopoulos and Shahin Kamali, Angelopoulos, Spyros

Subject Terms: FOS: Computer and information sciences, Online computation, phrases Online computation Rényi-Ulam games query models beyond worst-case analysis, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO] Computer Science [cs], ddc:004, beyond worst-case analysis, Theory of computation → Online algorithms, phrases Online computation, query models, Rényi-Ulam games

File Description: application/pdf

Access URL: http://arxiv.org/abs/2301.01631
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.13

View record at OpenAIRE

11

Academic Journal

Collective Tree Exploration via Potential Function Method

Authors: Cosson, Romain, Massoulié, Laurent

Contributors: Cosson, Romain, Romain Cosson and Laurent Massoulié

Subject Terms: FOS: Computer and information sciences, Competitive analysis, online algorithms, collective exploration, Mathematics of computing → Graph algorithms, Online algorithms, [INFO] Computer Science [cs], Theory of computation → Online algorithms, evolving tree, Computer Science - Data Structures and Algorithms, competitive analysis, Computer Science - Multiagent Systems, Data Structures and Algorithms (cs.DS), ddc:004, Evolving tree, Collective exploration, Multiagent Systems (cs.MA)

File Description: application/pdf

Access URL: http://arxiv.org/abs/2311.01354
https://hal.science/hal-04691075v1
https://doi.org/10.4230/lipics.itcs.2024.35
https://hal.science/hal-04691075v1/document
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.35

View record at OpenAIRE

12

Conference

Truthful Matching with Online Items and Offline Agents

Authors: Feldman, Michal, Fusco, Federico, Mauras, Simon, Reiffenhäuser, Rebecca

Contributors: Michal Feldman and Federico Fusco and Simon Mauras and Rebecca Reiffenhäuser, Etessami, Kousha, Feige, Uriel, Puppis, Gabriele, Etessami, K., Feige, U., Puppis, G.

Subject Terms: Applied computing → Online auctions, Online matching, Karp-Vazirani-Vazirani, online matching, Karp-Vazirani-Vazirani, truthfulness, ddc:004, Theory of computation → Online algorithms, truthfulness

File Description: application/pdf

Access URL: https://dare.uva.nl/personal/pure/en/publications/truthful-matching-with-online-items-and-offline-agents(e6458cbb-50d0-4ee3-8997-3f0363fb388b).html
https://hdl.handle.net/11245.1/e6458cbb-50d0-4ee3-8997-3f0363fb388b
https://doi.org/10.4230/LIPIcs.ICALP.2023.58
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.58
https://hdl.handle.net/11573/1684994
https://doi.org/10.4230/lipics.icalp.2023.58

View record at OpenAIRE

13

Conference

Competitive Search in the Line and the Star with Predictions

Authors: Angelopoulos, Spyros

Contributors: Spyros Angelopoulos, Angelopoulos, Spyros

Subject Terms: consistency and robustness, Search problems, Computer Science - Data Structures and Algorithms, competitive ratio, line and star search, Theory of computation → Theory and algorithms for application domains, [INFO] Computer Science [cs], ddc:004, predictions, Theory of computation → Online algorithms

File Description: application/pdf

Access URL: http://arxiv.org/abs/2312.17539
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.12
https://hal.science/hal-04248709v1
https://doi.org/10.4230/lipics.mfcs.2023.12
https://hal.science/hal-04248709v1/document

View record at OpenAIRE

14

Conference

Metrical service systems with transformations

Authors: Bubeck, S, Buchbinder, N, Coester, C, Sellke, M

Subject Terms: Theory of computation – online algorithms

Relation: https://doi.org/10.4230/LIPIcs.ITCS.2021.21

Availability: https://doi.org/10.4230/LIPIcs.ITCS.2021.21
https://ora.ox.ac.uk/objects/uuid:5343eeea-11f0-486b-ac4f-ada01833d71b

View record from BASE

15

Conference

Online metric allocation and time-varying regularization

Authors: Bansal, N, Coester, C

Subject Terms: Theory of computation – k-server algorithms, Theory of computation – online algorithms

Relation: https://doi.org/10.4230/LIPIcs.ESA.2022.13

Availability: https://doi.org/10.4230/LIPIcs.ESA.2022.13
https://ora.ox.ac.uk/objects/uuid:be0a5b9f-3f4b-4cc9-a5d3-7f69b313f2f1

View record from BASE

16

Conference

Online Simple Knapsack with Reservation Costs

Authors: Böckenhauer, Hans-Joachim, Burjons, Elisabet, Hromkovic, Juraj, Lotze, Henri, Rossmanith, Peter

Source: Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik [16:1]-16:18 (2021). doi:10.4230/LIPICS.STACS.2021.16 ; 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege ; 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege 38. International Symposium on Theoretical Aspects of Computer Science, STACS 2021, online, 2021-03-16 - 2021-03-19

Subject Terms: Online problem, Reservation costs, Simple knapsack, Theory of computation → Online algorithms

Subject Geographic: DE

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000635691700016; info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-180-1

Availability: https://publications.rwth-aachen.de/record/816354
https://publications.rwth-aachen.de/search?p=id:%22RWTH-2021-03127%22

View record from BASE

17

Academic Journal

Online Packing to Minimize Area or Perimeter

Authors: Abrahamsen, Mikkel, Beretta, Lorenzo

Contributors: Mikkel Abrahamsen and Lorenzo Beretta, Buchin, Kevin, de Verdiere, Eric Colin, de Verdière, Éric Colin

Source: Abrahamsen, M & Beretta, L 2021, Online packing to minimize area or perimeter . in K Buchin & E C de Verdiere (eds), 37th International Symposium on Computational Geometry, SoCG 2021 ., 6, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 189, 37th International Symposium on Computational Geometry, SoCG 2021, Virtual, Buffalo, United States, 07/06/2021 . https://doi.org/10.4230/LIPIcs.SoCG.2021.6
Abrahamsen, M & Beretta, L 2021, Online packing to minimize area or perimeter . in K Buchin & E C de Verdiere (eds), 37th International Symposium on Computational Geometry, SoCG 2021 ., 6, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Leibniz International Proceedings in Informatics, LIPIcs, vol. 189, 37th International Symposium on Computational Geometry, So

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, online algorithms, Theory of computation → Computational geometry, Online algorithms, 0102 computer and information sciences, Theory of computation → Online algorithms, 01 natural sciences, Theory of computation → Packing and covering problems, Packing, Computer Science - Computational Geometry, ddc:004, 0101 mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2101.09024
https://arxiv.org/abs/2101.09024
https://drops.dagstuhl.de/opus/volltexte/2021/13805/
https://dblp.uni-trier.de/db/journals/corr/corr2101.html#abs-2101-09024
https://drops.dagstuhl.de/opus/volltexte/2021/13805/pdf/LIPIcs-SoCG-2021-6.pdf/
https://cse.buffalo.edu/socg21/accepted.html#26
https://doi.org/10.4230/LIPIcs.SoCG.2021.6
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2021.6
https://curis.ku.dk/ws/files/273638588/Online_Packing_to_Minimize_Area_or_Perimeter.pdf

View record at OpenAIRE

18

Academic Journal

Metrical Service Systems with Transformations

Authors: Bubeck, S, Buchbinder, N, Coester, C, Sellke, M

Contributors: Sébastien Bubeck and Niv Buchbinder and Christian Coester and Mark Sellke

Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Theory of computation – online algorithms, Online algorithms, Metric Geometry (math.MG), 0102 computer and information sciences, 01 natural sciences, metrical task systems, Mathematics - Metric Geometry, Computer Science - Data Structures and Algorithms, k-taxi, FOS: Mathematics, competitive analysis, Data Structures and Algorithms (cs.DS), ddc:004, 0101 mathematics, Computer Science - Discrete Mathematics

File Description: application/pdf

Access URL: http://arxiv.org/abs/2009.08266
https://dblp.uni-trier.de/db/conf/innovations/innovations2021.html#BubeckBCS21
https://arxiv.org/abs/2009.08266
https://ir.cwi.nl/pub/31122
https://drops.dagstuhl.de/opus/volltexte/2021/13560/
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-08266
https://ir.cwi.nl/pub/31122/31122.pdf
https://ora.ox.ac.uk/objects/uuid:5343eeea-11f0-486b-ac4f-ada01833d71b
https://doi.org/10.4230/lipics.itcs.2021.21
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.21

View record at OpenAIRE

19

Conference

Removable Online Knapsack and Advice

Authors: Böckenhauer, Hans-Joachim, Frei, Fabian, Rossmanith, Peter

Contributors: Hans-Joachim Böckenhauer and Fabian Frei and Peter Rossmanith

Source: Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, Leibniz international proceedings in informatics 289, 18, [1]-17 (2024). doi:10.4230/LIPIcs.STACS.2024.18
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov
41st International Symposium on Theoretical Aspects of Computer Science : STACS 2024, March 12-14, 2024, Clermont-Ferrand, France / edited by Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, Daniel Lokshtanov41. International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, 2024-03-11-2024-03-14

Subject Terms: FOS: Computer and information sciences, Advice Applications, 0211 other engineering and technologies, Multiple Knapsack, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Theory of computation → Online algorithms, 01 natural sciences, Removable Online Knapsack, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Advice Analysis, Machine Learning and AI, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/pdf

Access URL: http://arxiv.org/abs/2005.01867
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.18
https://publications.rwth-aachen.de/record/998222

View record at OpenAIRE

20

Conference

Online Simple Knapsack with Reservation Costs

Authors: Böckenhauer, Hans-Joachim, Burjons, Elisabet, Hromkovič, Juraj, Lotze, Henri, Rossmanith, Peter

Contributors: Hans-Joachim Böckenhauer and Elisabet Burjons and Juraj Hromkovič and Henri Lotze and Peter Rossmanith, Bläser, Markus, Monmege, Benjamin

Source: Leibniz International Proceedings in Informatics (LIPIcs), 187
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
arXiv
Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik [16:1]-16:18 (2021). doi:10.4230/LIPICS.STACS.2021.16
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) / Herausgeber: Markus Bläser, Benjamin Monmege38. International Symposium on Theoretical Aspects of Computer Science, STACS 2021, online, 2021-03-16-2021-03-19

Subject Terms: Online problem, Simple knapsack, Reservation costs, ddc:004, Theory of computation → Online algorithms

File Description: application/pdf; application/application/pdf

Access URL: https://arxiv.org/abs/2009.14043
https://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-14043
https://drops.dagstuhl.de/opus/volltexte/2021/13661/
https://drops.dagstuhl.de/opus/volltexte/2021/13661/pdf/LIPIcs-STACS-2021-16.pdf/
https://www.research-collection.ethz.ch/handle/20.500.11850/495034
https://arxiv.org/pdf/2009.14043
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.16
http://hdl.handle.net/20.500.11850/495034
http://hdl.handle.net/20.500.11850/465681
https://publications.rwth-aachen.de/record/816354

View record at OpenAIRE

Search Tools:

Refine Results

Format

Subject

Publisher

Published in

Source

Geography

Collection

Year of Publication