642 search results - page 74 / 129 » Approximation Algorithms for Minimum K-Cut |
125
click to vote
JCO
2006
15 years 3 months ago
2006
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
136
click to vote
MP
2006
15 years 3 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
127
Voted
VC
2010
15 years 1 months ago
2010
Abstract In this paper, we present a segmentation algorithm which partitions a mesh based on the premise that a 3D object consists of a core body and its constituent protrusible pa...
138
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
126
Voted
STOC
2006
ACM
16 years 3 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...