Greedy and heuristic algorithms for codes and colorings

DOI10.1109/18.651069zbMath0911.94008OpenAlexW2150585727MaRDI QIDQ4392475

Patric R. J. Östergård, Tuvi Etzion

Publication date: 28 December 1998

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3772b8839be3ca1fe0d60b93ea49613b798e50c0

zbMATH Keywords

tabu searchcoloringgreedy algorithmsconstant weight codeevolution algorithmsminimum Hamming distancediscrete metricasymptotic code

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Bounds on codes (94B65) Other types of codes (94B60)

Related Items (6)

A review on algorithms for maximum clique problems ⋮ On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ On solving simplified diversified top-\(k\,s\)-plex problem ⋮ Random sampling accelerator for attribute reduction ⋮ A maximum edge-weight clique extraction algorithm based on branch-and-bound

This page was built for publication: Greedy and heuristic algorithms for codes and colorings