7006 search results - page 442 / 1402 » Approximation Algorithms |
134
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
235
Voted
CJ
2008
15 years 5 months ago
2008
We evaluate the average-case performance of three approximation algorithms for online non-clairvoyant scheduling of parallel tasks with precedence constraints. We show that for a ...
101
Voted
SIAMDM
2010
14 years 11 months ago
2010
Let A be a 0/1 matrix of size m
125
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
140
click to vote
ADCM
1998
15 years 4 months ago
1998
Using the framework provided by Clifford algebras, we consider a noncommutative quotient-difference algorithm for obtaining the elements of a continued fraction corresponding to...