Finding maximum independent sets in graphs arising from coding theory

Authors:
Sergiy Butenko;Panos Pardalos;Ivan Sergienko;Vladimir Shylo;Petro Stetsyuk
Affiliations:
University of Florida, Gainesville, FL;University of Florida, Gainesville, FL;Institute of Cybernetics, NAS of Ukraine, Kiev, Ukraine;Institute of Cybernetics, NAS of Ukraine, Kiev, Ukraine;Institute of Cybernetics, NAS of Ukraine, Kiev, Ukraine
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 3
Cited 3

New local search approximation techniques for maximum generalized satisfiability problems

CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Finding independent sets in a graph using continuous multivariable polynomial formulations

Journal of Global Optimization

Experimental analysis of approximation algorithms for the vertex cover and set covering problems

Computers and Operations Research
Fast local search for the maximum independent set problem

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Codes for deletion and insertion channels with segmented errors

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.08

Visualization

Abstract

New results are presented concerning binary correcting codes, such as deletion-correcting codes, transposition-correction codes, and codes for the Z-channel. These codes are important due to the possibility of packet loss and corruption on internet transmissions. It is known that the problem of finding the largest correcting codes can be reduced to a well-known combinatorial optimization problem on graphs, the maximum independent set problem. A general scheme of organizing a local search for the maximum independent set problem is discussed. Based on the developed heuristics, an exact branch-and-bound algorithm is proposed, which is able to find exact solutions for graphs with over 500 vertices within a reasonable time.