642 search results - page 81 / 129 » Approximation Algorithms for Minimum K-Cut |
LCN
2005
IEEE
15 years 5 months ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
STOC
1998
ACM
15 years 4 months ago
1998
ACM
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
CG
2002
Springer
14 years 11 months ago
2002
Springer
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the ...
CORR
2007
Springer
14 years 12 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...