1389 search results - page 42 / 278 » Improved Approximation Algorithms for Label Cover Problems |
86
Voted
COR
2008
14 years 11 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
NIPS
2003
15 years 1 months ago
2003
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
IPL
2011
14 years 6 months ago
2011
The segment minimization problem consists of representing an integer matrix as the sum of the fewest number of integer matrices each of which have the property that the non-zeroes...