642 search results - page 98 / 129 » Approximation Algorithms for Minimum K-Cut |
129
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
119
Voted
CPM
1999
Springer
15 years 7 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
128
Voted
PKDD
1999
Springer
15 years 7 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
125
click to vote
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
147
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...