Mining relevant information on the Web: a clique-based approach

DOI10.1080/00207540600693713zbMath1128.68356OpenAlexW2002695469MaRDI QIDQ5444416

Giovanni Felici, Massimiliano Caramia

Publication date: 25 February 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600693713

zbMATH Keywords

decision support systemscombinatorial optimizationdata mininge-businesse-manufacturingweb-based manufacture

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Operations research and management science (90B99) Theory of data (68P99)

Related Items (1)

Some spin glass ideas applied to the clique problem

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating maximum independent sets by excluding subgraphs
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Solving the maximum clique problem using a tabu search approach
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• Greedily Finding a Dense Subgraph
• The dense \(k\)-subgraph problem
• Reactive local search for the maximum clique problem
• Adaptive, restart, randomized greedy heuristics for maximum clique

This page was built for publication: Mining relevant information on the Web: a clique-based approach