642 search results - page 24 / 129 » Approximation Algorithms for Minimum K-Cut |
127
click to vote
DAM
2007
15 years 3 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
139
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
JRTIP
2008
15 years 3 months ago
2008
In the field of computer vision, it is becoming increasingly popular to implement algorithms, in sections or in their entirety, on a graphics processing unit (GPU). This is due to ...
145
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
158
click to vote
MOBIHOC
2002
ACM
16 years 2 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...