2137 search results - page 2 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
JMLR
2012
11 years 7 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
ISAAC
1998
Springer
13 years 9 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
CCCG
2010
13 years 6 months ago
2010
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...