Performance of the relaxation algorithm for maximum-cut problems

Kiichi Urahama, Hiroshi Nishiyuki

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)375-384
Number of pages10
JournalJournal of Circuits, Systems and Computers
Volume6
Issue number4
DOIs
Publication statusPublished - 1996
Externally publishedYes

Fingerprint

Gradient methods
Combinatorial optimization
Computational complexity

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Performance of the relaxation algorithm for maximum-cut problems. / Urahama, Kiichi; Nishiyuki, Hiroshi.

In: Journal of Circuits, Systems and Computers, Vol. 6, No. 4, 1996, p. 375-384.

Research output: Contribution to journalArticle

Urahama, Kiichi ; Nishiyuki, Hiroshi. / Performance of the relaxation algorithm for maximum-cut problems. In: Journal of Circuits, Systems and Computers. 1996 ; Vol. 6, No. 4. pp. 375-384.
@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

VL - 6

SP - 375

EP - 384

JO - Journal of Circuits, Systems and Computers

JF - Journal of Circuits, Systems and Computers

SN - 0218-1266

IS - 4

ER -