Sciweavers

3874 search results - page 172 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 5 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
WINE
2009
Springer
138views Economy» more  WINE 2009»
15 years 8 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
SPLC
2008
15 years 3 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt
125
Voted
SODA
2008
ACM
138views Algorithms» more  SODA 2008»
15 years 3 months ago
Fully polynomial time approximation schemes for stochastic dynamic programs
We develop a framework for obtaining Fully Polynomial Time Approximation Schemes (FPTASs) for stochastic univariate dynamic programs with either convex or monotone single-period c...
Nir Halman, Diego Klabjan, Chung-Lun Li, James B. ...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
15 years 11 months ago
Amplified Hardness of Approximation for VCG-Based Mechanisms
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
Shaddin Dughmi, Hu Fu, Robert Kleinberg