3875 search results - page 112 / 775 » Approximation algorithms for the 0-extension problem |
119
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
124
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
128
click to vote
AAAI
2004
15 years 5 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
128
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
126
click to vote
SDM
2007
SIAM
15 years 5 months ago
2007
SIAM
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...