Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Woeginger, Gerhard J. - Wiskunde en Informatica, Technische Universiteit Eindhoven
Getting the Best Response for Your Erg KIRK PRUHS AND PATCHRAWAT UTHAISOMBUT
The Computational Complexity of Graph Contractions I: Polynomially Solvable and NP-Complete Cases*
202 MATHEMATICS MAGAZINE When Cauchy and Holder Met Minkowski
When does a dynamic programming formulation guarantee the existence of an FPTAS?
On the approximability of average completion time scheduling under precedence constraints
Information Processing Letters 64 ( 1997) 293-297 There is no asymptotic PTAS for
Discrete Applied Mathematics 152 (2005) 634 www.elsevier.com/locate/dam
Mathematical Social Sciences 56 (2008) 224232 Contents lists available at ScienceDirect
Game-Theoretic, Permutable Symmetries for the Producer-Consumer Problem
Available online at www.sciencedirect.com Operations Research Letters 31 (2003) 195201
Discrete Comput Geom 7:45-58 (1992) Discrete & Computttional
Digital Object Identifier (DOI) 10.1007/s101070200298 Math. Program., Ser. A 93: 7786 (2002)
The Computational Complexity of Graph Contractions II: Two Tough Polynomially Solvable Cases
Non-approximability results for scheduling problems with minsum criteria
