A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph

A Local Search Approximation Algorithm for Max-k-Cut of Graph and Hypergraph

Given a graph or hyper graph, the graph or hyper graph Max-k-Cut problem is to partition the vertices into k nonempty sets such that the sum of weights of edges across different sets is maximized. We present a deterministic local search algorithm for the problem, which has a performance ratio 1 - 1/...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Wenxing Zhu, Chuanyin Guo
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Approximation algorithms
Approximation methods
approximation ratio
local search
Max-k-Cut
Optimized production technology
Partitioning algorithms
Polynomials
Programming
Search problems
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Given a graph or hyper graph, the graph or hyper graph Max-k-Cut problem is to partition the vertices into k nonempty sets such that the sum of weights of edges across different sets is maximized. We present a deterministic local search algorithm for the problem, which has a performance ratio 1 - 1/k for Max-k-Cut of graph, and has a similar result for Max-k-Cut of hyper graph.
ISSN:2168-3034
DOI:10.1109/PAAP.2011.35