-
1
المؤلفون: 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
-
2
-
3
المؤلفون: Kim-Manuel Klein, Marten Maack, Malin Rau, Klaus Jansen
المصدر: Mathematical Programming. 195:367-401
مصطلحات موضوعية: Mathematical optimization, Packing problems, Job shop scheduling, Approximations of π, General Mathematics, Numerical analysis, Scheduling (production processes), Integer programming, Software, Polynomial-time approximation scheme, Mathematics, Running time
-
4مورد إلكتروني
المؤلفون: Marten Maack and Simon Pukrop and Anna Rodriguez Rasmussen, Maack, Marten, Pukrop, Simon, Rasmussen, Anna Rodriguez
مصطلحات الفهرس: Scheduling, Restricted Assignment, Approximation, Inapproximability, InProceedings, Text, doc-type:ResearchArticle, publishedVersion
URL:
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.77
Is Part Of LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022) -
5مورد إلكتروني
المؤلفون: 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) -
6
المؤلفون: Daniel R. Page, Marten Maack, Roberto Solis-Oba
المصدر: Theoretical Computer Science. 809:204-217
مصطلحات موضوعية: 021103 operations research, General Computer Science, Job shop scheduling, Intersection (set theory), 0211 other engineering and technologies, Approximation algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Upper and lower bounds, Theoretical Computer Science, Planar graph, Combinatorics, symbols.namesake, 010201 computation theory & mathematics, Bounded function, symbols, Time complexity, Assignment problem, Mathematics
-
7
المؤلفون: Klaus Jansen, Marten Maack, Malin Rau
المصدر: ACM Transactions on Algorithms. 15:1-28
مصطلحات موضوعية: Discrete mathematics, Machine scheduling, Job shop scheduling, Bin packing problem, 010102 general mathematics, Approximation algorithm, 0102 computer and information sciences, 01 natural sciences, Scheduling (computing), Mathematics (miscellaneous), 010201 computation theory & mathematics, Bounded function, 0101 mathematics, Special case, Time complexity, Mathematics
-
8
المؤلفون: Marten Maack, Friedhelm Meyer auf der Heide, Simon Pukrop
المصدر: Approximation and Online Algorithms ISBN: 9783030927011
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::32bb1a97d9e99c1af322e74b590b89c3
https://doi.org/10.1007/978-3-030-92702-8_10 -
9
المؤلفون: Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies
مصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Computational Complexity, Computational Complexity (cs.CC)
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5691115b004b36b3dd0a3c548efb1e30
http://arxiv.org/abs/2011.06150 -
10مورد إلكتروني
المؤلفون: Max Bannach and Sebastian Berndt and Marten Maack and Matthias Mnich and Alexandra Lassota and Malin Rau and Malte Skambath, Bannach, Max, Berndt, Sebastian, Maack, Marten, Mnich, Matthias, Lassota, Alexandra, Rau, Malin, Skambath, Malte
مصطلحات الفهرس: Bin Packing, Knapsack, matching, fixed-parameter tractable, InProceedings, Text, doc-type:ResearchArticle, publishedVersion
URL:
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.11
Is Part Of LIPIcs, Volume 170, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)