Presentation 2013/3/11
A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming
Satoshi SHIMIZU, Kazuaki YAMAGUCHI, Toshiki SAITOH, Sumio MASUDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique problem. We propose a new exact algorithm based on the branch-and-bound. An upper bound of solution is calculated for each subproblem in branch-and-bound algorithms. Our algorithm makes some small subproblems, calculates their upper bounds by dynamic programming, and store the upper bounds to a table. In branch-and-bound, our algorithm calculates an upper bound fast by referring to the table. We confirm our algorithm is faster than other algorithms.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) maximum weight clique / branch-and-bound / dynamic programming / NP-hard
Paper # C0MP2012-59
Date of Issue

Conference Information
Committee COMP
Conference Date 2013/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming
Sub Title (in English)
Keyword(1) maximum weight clique
Keyword(2) branch-and-bound
Keyword(3) dynamic programming
Keyword(4) NP-hard
1st Author's Name Satoshi SHIMIZU
1st Author's Affiliation Kobe University()
2nd Author's Name Kazuaki YAMAGUCHI
2nd Author's Affiliation Kobe University
3rd Author's Name Toshiki SAITOH
3rd Author's Affiliation Kobe University
4th Author's Name Sumio MASUDA
4th Author's Affiliation Kobe University
Date 2013/3/11
Paper # C0MP2012-59
Volume (vol) vol.112
Number (no) 498
Page pp.pp.-
#Pages 7
Date of Issue