642 search results - page 66 / 129 » Approximation Algorithms for Minimum K-Cut |
124
click to vote
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
101
click to vote
EAAI
2007
14 years 11 months ago
2007
This paper presents a swarm intelligence based approach to optimally partition combinational CMOS circuits for pseudoexhaustive testing. The partitioning algorithm ensures reducti...
131
click to vote
STOC
1995
ACM
15 years 3 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
100
click to vote
STOC
2005
ACM
15 years 5 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
187
click to vote
ACID
2006
15 years 1 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...