An EPTAS for Scheduling on Unrelated Machines of Few Different Types (English)
- New search for: Jansen, Klaus
- New search for: Maack, Marten
- Further information on Maack, Marten:
- https://orcid.org/0000-0001-7918-6642
- New search for: Jansen, Klaus
- New search for: Maack, Marten
- Further information on Maack, Marten:
- https://orcid.org/0000-0001-7918-6642
In:
Algorithmica
;
81
, 10
; 4134-4164
;
2019
-
ISSN:
- Article (Journal) / Print
-
Title:An EPTAS for Scheduling on Unrelated Machines of Few Different Types
-
Contributors:Jansen, Klaus ( author ) / Maack, Marten ( author )
-
Published in:Algorithmica ; 81, 10 ; 4134-4164
-
Publisher:
- New search for: Springer US
- New search for: Springer
-
Place of publication:New York, N.Y.
-
Publication date:2019
-
ISSN:
-
ZDBID:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: 54.00
- Further information on Basic classification
- New search for: 770/3145/3155
-
Keywords:
-
Classification:
BKL: 54.00 Informatik: Allgemeines Local classification TIB: 770/3145/3155 -
Source:
Table of contents – Volume 81, Issue 10
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 3843
-
Editor’s Note: Special Issue on Parameterized and Exact Computation| 2019
- 3844
-
A Fixed-Parameter Perspective on #BISCurticapean, Radu / Dell, Holger / Fomin, Fedor / Goldberg, Leslie Ann / Lapinskas, John et al. | 2019
- 3865
-
Optimal Data Reduction for Graph Coloring Using Low-Degree PolynomialsJansen, Bart M. P. / Pieterse, Astrid et al. | 2019
- 3890
-
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized AlgorithmsBonnet, Édouard / Brettell, Nick / Kwon, O-joung / Marx, Dániel et al. | 2019
- 3936
-
Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological MinorJansen, Bart M. P. / Pilipczuk, Marcin / Wrochna, Marcin et al. | 2019
- 3968
-
Tight Conditional Lower Bounds for Longest Common Increasing SubsequenceDuraj, Lech / Künnemann, Marvin / Polak, Adam et al. | 2018
- 3993
-
New Tools and Connections for Exponential-Time ApproximationBansal, Nikhil / Chalermsook, Parinya / Laekhanukit, Bundit / Nanongkai, Danupon / Nederlof, Jesper et al. | 2018
- 4010
-
Generalized Kakeya sets for polynomial evaluation and faster computation of fermionantsBjörklund, Andreas / Kaski, Petteri / Williams, Ryan et al. | 2018
- 4029
-
An Exponential Lower Bound for Cut Sparsifiers in Planar GraphsKarpov, Nikolai / Pilipczuk, Marcin / Zych-Pawlewicz, Anna et al. | 2018
- 4043
-
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?Bougeret, Marin / Sau, Ignasi et al. | 2018
- 4069
-
Preface: Special Issue on WADS 2017| 2019
- 4070
-
Approximating Small Balanced Vertex Separators in Almost Linear TimeBrandt, Sebastian / Wattenhofer, Roger et al. | 2018
- 4098
-
Modular Circulation and Applications to Traffic ManagementDasler, Philip / Mount, David M. et al. | 2018
- 4118
-
A Faster Algorithm for Truth Discovery via Range CoverHuang, Ziyun / Ding, Hu / Xu, Jinhui et al. | 2019
- 4134
-
An EPTAS for Scheduling on Unrelated Machines of Few Different TypesJansen, Klaus / Maack, Marten et al. | 2019