2137 search results - page 309 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
169
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
131
click to vote
LATIN
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
184
click to vote
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
119
Voted
AAAI
2006
15 years 6 months ago
2006
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
147
click to vote
PERCOM
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...