Author

David P. Williamson

Created by ACM worker at 2019-04-10 10:27:24.0.

Simplified Graph of Associations

Word Cloud

Could you solve a captcha to retrieve Joao Crisóstomo Weyl Albuquerque Costa's Lattes?

Cole aqui o código fonte do lattes da pessoa:

Sim, eu sei, isso é feio, é horrível. Mas o Lattes mudou para o recaptcha, e agora não sei mais como contornar.

Yes

Why?

Publications

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Scheduling Parallel Machines On-Line

.879-approximation algorithms for MAX CUT and MAX 2SAT

A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction

Analyzing the Held-Karp tsp bound: a monotonicity property with application

Published At

SIAM Journal on Computing

Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC ’94

Journal of the ACM

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC ’97

Information Processing Letters

Co-Authors

Referenced By

Approximating the cut-norm via Grothendieck’s inequality

A unified approach to scheduling on unrelated parallel machines

Random sampling and approximation of MAX-CSP problems

Selfish load balancing and atomic congestion games

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems