1397 search results - page 5 / 280 » Algorithms for Proximity Problems on Colored Point Sets |
SODA
2000
ACM
13 years 8 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
JDA
2011
13 years 2 months ago
2011
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
SIGMETRICS
2010
ACM
14 years 5 days ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
CPM
2009
Springer
14 years 1 months ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
CCCG
2010
13 years 8 months ago
2010
We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by ha...