Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Williamson, David P. - Department of Computer Science, School of Operations Research and Industrial Engineering, Cornell University
RJ 10296 (Log# A0306022) (06/25/2003) Computer Science/Mathematics
Approximate kMSTs and kSteiner Trees via the PrimalDual Method and Lagrangean Relaxation
A 1.47approximation algorithm for a preemptive singlemachine scheduling problem
To appear in Combinatorica. Preliminary version appeared in IPCO '96. PrimalDual Approximation Algorithms
Short shop schedules D. P. Williamson
RC 21273 (09/03/98) Computer Science/Mathematics
Approximation Algorithms for Max3Cut and Other Problems via Complex Semidefinite Programming #
Posted from SIAM Journal on Discrete Mathematics, 13:281294, 2000. Copyright 2000 by the Society for Industrial and Applied Mathematics. All rights reserved.
Improved approximation algorithms for capacitated facility location problems
Iterative Rounding 2Approximation Algorithms for MinimumCost Vertex Connectivity Problems
A primaldual schema based approximation algorithm for the element connectivity
4 Approximation Algorithm for MAX SAT Michel X. Goemans \Lambda
Improved Approximation Algorithms for MAX SAT # Takao Asano + David P. Williamson #
