5595 search results - page 411 / 1119 » Approximation Algorithms for Clustering Problems |
190
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
183
click to vote
BICOB
2009
Springer
16 years 1 months ago
2009
Springer
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
214
click to vote
ASUNAM
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
160
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
227
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...