Sciweavers

7129 search results - page 450 / 1426
» Approximation Algorithms for Treewidth
Sort
View
MP
2010
154views more  MP 2010»
15 years 4 months ago
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
Xinwei Liu, Yaxiang Yuan
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
16 years 3 months ago
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
Subhash Khot, Assaf Naor
ICDT
2005
ACM
131views Database» more  ICDT 2005»
15 years 12 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
JCSS
2008
138views more  JCSS 2008»
15 years 6 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
16 years 3 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld