1272 search results - page 24 / 255 » The Set Cover with Pairs Problem |
80
Voted
STOC
2002
ACM
16 years 29 days ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
120
click to vote
SIGMOD
2000
ACM
15 years 5 months ago
2000
ACM
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
99
Voted
NAR
2011
14 years 3 months ago
2011
The predicted Arabidopsis interactome resource (PAIR, http://www.cls.zju.edu.cn/pair/), comprised of 5990 experimentally reported molecular interactions in Arabidopsis thaliana to...
113
Voted
ESA
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
123
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...