2137 search results - page 217 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
180
click to vote
PPSN
2004
Springer
15 years 11 months ago
2004
Springer
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our ...
172
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
159
click to vote
AAAI
1998
15 years 7 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
158
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
225
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...