5473 search results - page 641 / 1095 » On the graph isomorphism problem |
155
Voted
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We show for several planar and geometric problems that the best known approximation schemes are essentially optimal with respect to the dependence on ǫ. For example, we show that...
175
click to vote
PODC
2005
ACM
16 years 13 days ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
189
click to vote
DIALM
2004
ACM
16 years 9 days ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
172
Voted
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
150
Voted
ESA
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing ...