2137 search results - page 13 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
102
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
135
Voted
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
129
click to vote
ALGOSENSORS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Motivated by the need for agent classification in sensor networking and autonomous vehicle control applications, we propose a flexible and distributed stochastic automato...
126
Voted
TCS
2010
15 years 6 days 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...
103
click to vote
ICTCS
2005
Springer
15 years 7 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...