840 search results - page 113 / 168 » Inapproximability of Combinatorial Optimization Problems |
130
Voted
INFORMATICALT
2002
15 years 2 months ago
2002
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
149
click to vote
JMLR
2006
15 years 2 months ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
107
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
192
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
130
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...