المؤلفون: Sebastian Berndt, Leah Epstein, Klaus Jansen, Asaf Levin, Marten Maack, Lars Rohwedder

المساهمون: QE Econometrics, RS: GSBE other - not theme-related research

المصدر: Journal of Computer and System Sciences, 134, 42-72. Academic Press Inc.

مصطلحات موضوعية: FOS: Computer and information sciences, 000 Computer science, knowledge, general works, APPROXIMATION SCHEMES, General Computer Science, Computer Networks and Communications, Applied Mathematics, The migration factor, ALGORITHMS, Theoretical Computer Science, DUAL VERSION, Computational Theory and Mathematics, Computer Science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Worst-case analysis, Bin covering

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a3ce8195bccd50c92aeefa2cc6c89629
https://doi.org/10.1016/j.jcss.2023.01.001

المؤلفون: Kim-Manuel Klein, Adam Polak, Lars Rohwedder

المصدر: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::073543525eb810f60119b08fc0582b90
https://doi.org/10.1137/1.9781611977554.ch112

المؤلفون: Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae

المصدر: Integer Programming and Combinatorial Optimization ISBN: 9783031327254

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::a715b46d267d9c4454777e20cf4fcf4d
https://doi.org/10.1007/978-3-031-32726-1_9

المؤلفون: Klaus Jansen, Lars Rohwedder

المساهمون: QE Econometrics, RS: GSBE other - not theme-related research

المصدر: Mathematics of Operations Research. Institute for Operations Research and the Management Sciences

مصطلحات موضوعية: FOS: Computer and information sciences, dynamic programming, fixed-parameter tractable, fine-grained complexity, General Mathematics, Computer Science - Data Structures and Algorithms, ALGORITHMS, LINEAR-TIME, Data Structures and Algorithms (cs.DS), DIMENSION, Management Science and Operations Research, Computer Science Applications

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b55d7a83fe42ec27656fcba3a3be49d7
https://doi.org/10.1287/moor.2022.1308

المؤلفون: Leah Epstein and Alexandra Lassota and Asaf Levin and Marten Maack and Lars Rohwedder, Epstein, Leah, Lassota, Alexandra, Levin, Asaf, Maack, Marten, Rohwedder, Lars

مصطلحات الفهرس: Cardinality Constrained Scheduling, Makespan Minimization, Online Algorithms, Lower Bounds, Pure Online, Migration, Ordinal Algorithms, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.28
Is Part Of LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)

المؤلفون: Lars Rohwedder, Klaus Jansen

المصدر: Integer Programming and Combinatorial Optimization ISBN: 9783319592497
IPCO

مصطلحات موضوعية: FOS: Computer and information sciences, Mathematical optimization, General Computer Science, Computer science, local search, General Mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, unrelated machines, Quasi-polynomial, 01 natural sciences, Polynomial algorithm, Scheduling (computing), Combinatorics, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), scheduling, Special case, approximation, Mathematics, integrality gap, Discrete mathematics, 021103 operations research, Job shop scheduling, Running time, Linear programming relaxation, 010201 computation theory & mathematics, Combinatorial optimization, Assignment problem

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d1925d4b6c5aa2d381ea1f5548043909
https://doi.org/10.1137/19m128257x

المؤلفون: Jana Cslovjecsek, Robert Weismantel, Lars Rohwedder, Christoph Hunkenschröder, Friedrich Eisenbrand

المصدر: SODA

مصطلحات موضوعية: Discrete mathematics, Linear programming, Computer science, business.industry, Subroutine, Dimension (graph theory), Local search (optimization), Relaxation (approximation), business, Time complexity, Integer programming, Integer (computer science)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::1fda1a09ca311dbf1fb7a06b3e47f98e
https://doi.org/10.1137/1.9781611976465.101

المؤلفون: Adam Polak and Lars Rohwedder and Karol Węgrzycki, Polak, Adam, Rohwedder, Lars, Węgrzycki, Karol

مصطلحات الفهرس: Knapsack, Subset Sum, Proximity, Additive Combinatorics, Multiset, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.106
Is Part Of LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)

المؤلفون: Michael Poss, Lars Rohwedder, Marin Bougeret, Klaus Jansen

المساهمون: Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Kiel University, Algorithmes, Graphes et Combinatoire (ALGCO), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Theory of Parallelism, Department of Computer Science, Christian-Albrechts-Universität zu Kiel (CAU)-Christian-Albrechts-Universität zu Kiel (CAU), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux (MAORE)

المصدر: Approximation and Online Algorithms ISBN: 9783030394783
WAOA
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2021, 65 (6), pp.903-915. ⟨10.1007/s00224-020-10024-7⟩
WAOA 2019
WAOA 2019, Sep 2019, Munich, Germany
WAOA 2019-17th International Workshop on Approximation and Online Algorithms
WAOA 2019-17th International Workshop on Approximation and Online Algorithms, Sep 2019, Munich, Germany. pp.60-71, ⟨10.1007/978-3-030-39479-0_5⟩

مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Schedule, Mathematical optimization, Discrete Mathematics (cs.DM), Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Makespan minimization, 0211 other engineering and technologies, robust optimization, 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], unrelated machines, 01 natural sciences, Theoretical Computer Science, Set (abstract data type), Cardinality, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), approximation algorithms, Computer Science::Operating Systems, Computer Science::Distributed, Parallel, and Cluster Computing, 021103 operations research, Job shop scheduling, parallel machines, Approximation algorithm, Robust optimization, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], EPTAS, Computational Theory and Mathematics, 010201 computation theory & mathematics, Theory of computation, Minification, Computer Science - Discrete Mathematics, EP-TAS

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::865cc7b4417afdba1df9e9dcb260f8e4
https://doi.org/10.1007/978-3-030-39479-0_5

المؤلفون: Paritosh Garg and Sagar Kale and Lars Rohwedder and Ola Svensson, Garg, Paritosh, Kale, Sagar, Rohwedder, Lars, Svensson, Ola

مصطلحات الفهرس: Streaming algorithm, adversary, submodular maximization, matching, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.56
Is Part Of LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

المؤلفون: Lars Rohwedder, Klaus Jansen

مصطلحات موضوعية: FOS: Computer and information sciences, business.industry, fair allocation, Value (computer science), Computer Science Applications, Theoretical Computer Science, Connection (mathematics), Combinatorics, Set (abstract data type), analysis of algorithms, Signal Processing, Computer Science - Data Structures and Algorithms, Local search (optimization), Data Structures and Algorithms (cs.DS), configuration lp, business, Time complexity, Information Systems, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87fb70361abc2976c0b7a469717e7855
http://arxiv.org/abs/1807.03626

المؤلفون: Sebastian Berndt and Leah Epstein and Klaus Jansen and Asaf Levin and Marten Maack and Lars Rohwedder, Berndt, Sebastian, Epstein, Leah, Jansen, Klaus, Levin, Asaf, Maack, Marten, Rohwedder, Lars

مصطلحات الفهرس: online algorithms, dynamic algorithms, competitive ratio, bin covering, migration factor, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.18
Is Part Of LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)

المؤلفون: Klaus Jansen and Lars Rohwedder, Jansen, Klaus, Rohwedder, Lars

مصطلحات الفهرس: graph, approximation algorithm, scheduling, integrality gap, local search, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.74
Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

المؤلفون: Klaus Jansen and Alexandra Lassota and Lars Rohwedder, Jansen, Klaus, Lassota, Alexandra, Rohwedder, Lars

مصطلحات الفهرس: Near-Linear Time Algorithm, n-fold ILP, Color Coding, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.75
Is Part Of LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

المؤلفون: Klaus Jansen and Lars Rohwedder, Jansen, Klaus, Rohwedder, Lars

مصطلحات الفهرس: Integer programming, convolution, dynamic programming, SETH, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.43
Is Part Of LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019)

المؤلفون: Klaus Jansen and Lars Rohwedder, Jansen, Klaus, Rohwedder, Lars

مصطلحات الفهرس: Linear programming, unrelated machines, makespan, max-min, restricted assignment, santa claus, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2018.11
Is Part Of OASIcs, Volume 61, 1st Symposium on Simplicity in Algorithms (SOSA 2018)

المؤلفون: Klaus Jansen, Lars Rohwedder

المصدر: Algorithms and Discrete Applied Mathematics ISBN: 9783319530062
CALDAM

مصطلحات موضوعية: Computer science, Polynomial algorithm, Algorithm, Assignment problem, Scheduling (computing)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::c67b4de5fb8940b8ce384646888e697a
https://doi.org/10.1007/978-3-319-53007-9_21

المؤلفون: Klaus Jansen, Lars Rohwedder

مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::513956ef6e11f8e0f2fc21ecdd707807

المؤلفون: Alexandra Lassota, Klaus Jansen, Lars Rohwedder

مصطلحات موضوعية: Discrete mathematics, FOS: Computer and information sciences, 000 Computer science, knowledge, general works, Fold (higher-order function), General Mathematics, 0102 computer and information sciences, 01 natural sciences, n-fold ilp, color coding, Combinatorics, Integer, near-linear time algorithm, 010201 computation theory & mathematics, Computer Science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Time complexity, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37734a72e443f0760a417d18e07cde2b
https://infoscience.epfl.ch/record/282707

المؤلفون: Epstein, Leah, Lassota, Alexandra, Levin, Asaf, Maack, Marten, Rohwedder, Lars

المساهمون: Leah Epstein and Alexandra Lassota and Asaf Levin and Marten Maack and Lars Rohwedder

مصطلحات موضوعية: Cardinality Constrained Scheduling, Makespan Minimization, Online Algorithms, Lower Bounds, Pure Online, Migration, Ordinal Algorithms

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 219, 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.28

الاتاحة: https://doi.org/10.4230/LIPIcs.STACS.2022.28
https://nbn-resolving.org/urn:nbn:de:0030-drops-158385
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.28