Skip to main content
Conference Proceedings

A unified framework for approximating multiway partition problemsExtended Abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2223 LNCS 682-694
DOI: 10.1007/3-540-45678-3_58
6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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 kcut), multiterminal cut (or multiway cut), hypergraph partition and target split. © 2001 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhao, L., Nagamochi, H., & Ibaraki, T. (2001). A unified framework for approximating multiway partition problemsExtended Abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2223 LNCS, pp. 682–694). https://doi.org/10.1007/3-540-45678-3_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free