Prati
Gerhard Woeginger
Gerhard Woeginger
Professor of Computer Science, RWTH Aachen
Potvrđena adresa e-pošte na cs.rwth-aachen.de
Naslov
Citirano
Citirano
Godina
Online algorithms: The state of the art
A Fiat, GJ Woeginger
LNCS, Springer-Verlag 1442, 1998
2243*1998
Exact algorithms for NP-hard problems: A survey
GJ Woeginger
Combinatorial optimization — Eureka, you shrink!, 185-207, 2003
9922003
A compendium of NP optimization problems
P Crescenzi, V Kann, MM Halldórsson, M Karpinski, GJ Woeginger
URL http://www.nada.kth.se/~viggo/problemlist/compendium.html, 2000
757*2000
Computing and Software Science
B Steffen, G Woeginger
Springer Nature, LNCS 10000, 2019
620*2019
A review of machine scheduling: Complexity, algorithms and approximability
B Chen, CN Potts, GJ Woeginger
Handbook of Combinatorial Optimization 3, 21-169, 1998
516*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
2762000
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
270*1998
Approximation schemes for scheduling on parallel machines
N Alon, Y Azar, GJ Woeginger, T Yadid
Journal of Scheduling 1 (1), 55-66, 1998
2521998
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
2412009
On-line packing and covering problems
J Csirik, GJ Woeginger
Online algorithms: the state of the art, 147-177, 2005
2382005
A polynomial-time approximation scheme for maximizing the minimum machine completion time
GJ Woeginger
Operations Research Letters 20 (4), 149-154, 1997
2371997
Complexity of coloring graphs without forbidden induced subgraphs
D Král’, J Kratochvíl, Z Tuza, GJ Woeginger
Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG …, 2001
2222001
Almost tight bounds for ɛ-Nets
J Komlós, J Pach, G Woeginger
Discrete & Computational Geometry 7 (1), 163-173, 1992
1931992
Polynomial time approximation algorithms for machine scheduling: Ten open problems
P Schuurman, GJ Woeginger
Journal of Scheduling 2 (5), 203-213, 1999
1861999
An axiomatic characterization of the Hirsch-index
GJ Woeginger
Mathematical Social Sciences 56 (2), 224-232, 2008
1852008
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
1812004
Approximability and nonapproximability results for minimizing total flow time on a single machine
H Kellerer, T Tautenhahn, GJ Woeginger
Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing …, 1996
1811996
Getting the best response for your erg
K Pruhs, P Uthaisombut, G Woeginger
ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008
178*2008
Proceedings of 43rd Workshop on Graph-Theoretic Concepts in Computer Science
HL Bodlaender, GJ Woeginger
Springer LNCS 10520, 2017
173*2017
There is no asymptotic PTAS for two-dimensional vector packing
GJ Woeginger
Information Processing Letters 64 (6), 293-297, 1997
1661997
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20