Gerhard Woeginger
Gerhard Woeginger
Professor of Computer Science, RWTH Aachen
Dirección de correo verificada de
Citado por
Citado por
Online algorithms: The state of the art
A Fiat, GJ Woeginger
LNCS, Springer-Verlag 1442, 1998
Exact algorithms for NP-hard problems: A survey
GJ Woeginger
Combinatorial optimization — Eureka, you shrink!, 185-207, 2003
A compendium of NP optimization problems
P Crescenzi, V Kann, MM Halldórsson, M Karpinski, GJ Woeginger
URL, 2000
A review of machine scheduling: Complexity, algorithms and approximability
B Chen, CN Potts, GJ Woeginger
Handbook of Combinatorial Optimization 3, 21-169, 1998
Well-solvable special cases of the traveling salesman problem: a survey
RE Burkard, VG Deineko, R van Dal, JAA van der Veen, GJ Woeginger
SIAM Review 40 (3), 496-546, 1998
When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?
GJ Woeginger
INFORMS Journal on Computing 12 (1), 57-74, 2000
On-line packing and covering problems
J Csirik, GJ Woeginger
Online Algorithms, 147-177, 1998
Approximation schemes for scheduling on parallel machines
N Alon, Y Azar, GJ Woeginger, T Yadid
Journal of Scheduling 1 (1), 55-66, 1998
Uncapacitated single and multiple allocation p-hub center problems
AT Ernst, H Hamacher, H Jiang, M Krishnamoorthy, G Woeginger
Computers & Operations Research 36 (7), 2230-2241, 2009
An axiomatic characterization of the Hirsch-index
GJ Woeginger
Mathematical Social Sciences 56 (2), 224-232, 2008
A polynomial-time approximation scheme for maximizing the minimum machine completion time
GJ Woeginger
Operations Research Letters 20 (4), 149-154, 1997
Almost tight bounds for ɛ-Nets
J Komlós, J Pach, G Woeginger
Discrete & Computational Geometry 7 (1), 163-173, 1992
Complexity of coloring graphs without forbidden induced subgraphs
D Král, J Kratochvíl, Z Tuza, GJ Woeginger
27th International Workshop on Graph-Theoretic Concepts in Computer Science …, 2001
Getting the best response for your erg
K Pruhs, P Uthaisombut, G Woeginger
ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008
Approximability and nonapproximability results for minimizing total flow time on a single machine
H Kellerer, T Tautenhahn, G Woeginger
SIAM Journal on Computing 28 (4), 1155-1166, 1999
Polynomial time approximation algorithms for machine scheduling: Ten open problems
P Schuurman, GJ Woeginger
Journal of Scheduling 2 (5), 203-213, 1999
Dagstuhl seminar June 1996 on online algorithms
A Fiat, G Woeginger
Dagstuhl Seminar Report, 1996
On-line scheduling of jobs with fixed start and end times
GJ Woeginger
Theoretical Computer Science 130 (1), 5-16, 1994
Exact (exponential) algorithms for the dominating set problem
FV Fomin, D Kratsch, GJ Woeginger
Graph-Theoretic Concepts in Computer Science (WG) 3353, 245-256, 2004
Non-approximability results for scheduling problems with minsum criteria
H Hoogeveen, P Schuurman, GJ Woeginger
INFORMS Journal on Computing 13 (2), 157-168, 2001
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20