68 search results - page 3 / 14 » Practical Approximation Algorithms for Separable Packing Lin... |
159
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
119
click to vote
MP
2010
15 years 7 days ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
132
Voted
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
146
Voted
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
102
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...