Name
Abstract | ||
|---|---|---|
We present a simple and unified framework for developing and analyzing approximation algorithms for some multiway partition problems (with or without terminals), including the k-way cut (or k- cut), multiterminal cut (or multiway cut), hypergraph partition and target split. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1007/3-540-45678-3_58 | ISAAC |
Keywords | Field | DocType |
hypergraph partition,k-way cut,approximating multiway partition problems,unified framework,multiway partition problem,approximation algorithm,target split,multiway cut,multiterminal cut | Graph theory,Hypergraph partition,Discrete mathematics,Approximation algorithm,Combinatorics,Computer science,Hypergraph,Submodular set function,Greedy algorithm,Partition (number theory),Time complexity | Conference |
ISBN | Citations | PageRank |
3-540-42985-9 | 4 | 0.50 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Zhao | 1 | 366 | 48.82 |
| Hiroshi Nagamochi | 2 | 1513 | 174.40 |
| Toshihide Ibaraki | 3 | 2593 | 385.64 |