1389 search results - page 27 / 278 » Improved Approximation Algorithms for Label Cover Problems |
CORR
2002
Springer
14 years 11 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
164
click to vote
DC
2011
13 years 11 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
SODA
1997
ACM
15 years 28 days ago
1997
ACM
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
ESA
2003
Springer
15 years 4 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...