1424 search results - page 110 / 285 » The Multi-radius Cover Problem |
120
click to vote
ACSC
2005
IEEE
15 years 9 months ago
2005
IEEE
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
150
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
114
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
114
click to vote
DM
1998
15 years 3 months ago
1998
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
121
Voted
ACSC
2003
IEEE
15 years 8 months ago
2003
IEEE
The Map Labelling Problem appears in several applications, mainly in Cartography. Although much research on this problem has been done, it is interesting to note that map-labellin...