Approximating the maximum vertex/edge weighted clique using local search
From MaRDI portal
Publication:1009183
DOI10.1007/s10732-007-9026-2zbMath1173.90569MaRDI QIDQ1009183
Publication date: 31 March 2009
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-007-9026-2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating maximum independent sets by excluding subgraphs
- A fast algorithm for the maximum weight clique problem
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Annealed replication: A new heuristic for the maximum clique problem
- An application of tabu search heuristic for the maximum edge-weighted subgraph problem
- Phased local search for the maximum clique problem
- Finding a Maximum Clique in an Arbitrary Graph