8 search results - page 2 / 2 » Approximation Algorithms for Disjoint st-Paths with Minimum ... |
TCS
2010
13 years 3 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
Resource limitations in wireless sensor networks have put stringent constraints on distributed signal processing. In this paper, we propose a cluster-based decentralized variation...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...