Performance of the relaxation algorithm for maximum-cut problems

Kiichi Urahama; Hiroshi Nishiyuki

doi:10.1142/S021812669600025X

Performance of the relaxation algorithm for maximum-cut problems

Kiichi Urahama, Hiroshi Nishiyuki

Research output: Contribution to journal › Article › peer-review

Abstract

A relaxation algorithm is presented for solving a class of combinatorial optimization problems called set-partitioning tasks. The convergence property of the presented algorithm is investigated theoretically. A performance guarantee is derived theoretically for the present algorithm applied to an NP-hard example problem called the maximum-cut graph partitioning. The experimental examination of its performance manifests its superiority in computational speed to the conventional gradient method.

Original language	English
Pages (from-to)	375-384
Number of pages	10
Journal	Journal of Circuits, Systems and Computers
Volume	6
Issue number	4
DOIs	https://doi.org/10.1142/S021812669600025X
Publication status	Published - 1996
Externally published	Yes

All Science Journal Classification (ASJC) codes

Hardware and Architecture
Electrical and Electronic Engineering

Access to Document

10.1142/S021812669600025X

Cite this

@article{22bc3a0a372f4b908049667e0f0c0c16,

title = "Performance of the relaxation algorithm for maximum-cut problems",

abstract = "A relaxation algorithm is presented for solving a class of combinatorial optimization problems called set-partitioning tasks. The convergence property of the presented algorithm is investigated theoretically. A performance guarantee is derived theoretically for the present algorithm applied to an NP-hard example problem called the maximum-cut graph partitioning. The experimental examination of its performance manifests its superiority in computational speed to the conventional gradient method.",

author = "Kiichi Urahama and Hiroshi Nishiyuki",

year = "1996",

doi = "10.1142/S021812669600025X",

language = "English",

volume = "6",

pages = "375--384",

journal = "Journal of Circuits, Systems and Computers",

issn = "0218-1266",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "4",

}

TY - JOUR

T1 - Performance of the relaxation algorithm for maximum-cut problems

AU - Urahama, Kiichi

AU - Nishiyuki, Hiroshi

PY - 1996

Y1 - 1996

N2 - A relaxation algorithm is presented for solving a class of combinatorial optimization problems called set-partitioning tasks. The convergence property of the presented algorithm is investigated theoretically. A performance guarantee is derived theoretically for the present algorithm applied to an NP-hard example problem called the maximum-cut graph partitioning. The experimental examination of its performance manifests its superiority in computational speed to the conventional gradient method.

AB - A relaxation algorithm is presented for solving a class of combinatorial optimization problems called set-partitioning tasks. The convergence property of the presented algorithm is investigated theoretically. A performance guarantee is derived theoretically for the present algorithm applied to an NP-hard example problem called the maximum-cut graph partitioning. The experimental examination of its performance manifests its superiority in computational speed to the conventional gradient method.

UR - http://www.scopus.com/inward/record.url?scp=3042955700&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=3042955700&partnerID=8YFLogxK

U2 - 10.1142/S021812669600025X

DO - 10.1142/S021812669600025X

M3 - Article

AN - SCOPUS:3042955700

SN - 0218-1266

VL - 6

SP - 375

EP - 384

JO - Journal of Circuits, Systems and Computers

JF - Journal of Circuits, Systems and Computers

IS - 4

ER -

Performance of the relaxation algorithm for maximum-cut problems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this