2137 search results - page 28 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
ASIAN
1999
Springer
14 years 28 days ago
1999
Springer
APPROX
2006
Springer
14 years 11 days ago
2006
Springer
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
EVOW
2006
Springer
14 years 9 days ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
STACS
2001
Springer
14 years 1 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...