Integer models and upper bounds for the 3-club problem

Authors:
Maria Teresa Almeida;Filipa D. Carvalho
Affiliations:
ISEG, Universidade Técnica de Lisboa, Rua do Quelhas 6, 1200-781 Lisboa, Portugal and CIO, FC, Universidade de Lisboa, Bloco C6, Piso 4, 1749-016 Lisboa, Portugal;ISEG, Universidade Técnica de Lisboa, Rua do Quelhas 6, 1200-781 Lisboa, Portugal and CIO, FC, Universidade de Lisboa, Bloco C6, Piso 4, 1749-016 Lisboa, Portugal
Venue:
Networks
Year:
2012

Citing 8
Cited 2

Integer and combinatorial optimization

Integer and combinatorial optimization
Efficient identification of Web communities

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees

Networks
Mining market data: a network approach

Computers and Operations Research
A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees

Networks - Special Issue on Trees
Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion

Networks - Special Issue on Trees
Extended and discretized formulations for the maximum clique problem

Computers and Operations Research
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

Operations Research

Finding large $$k$$-clubs in undirected graphs

Computing
Algorithms for the maximum k-club problem in graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an undirected graph, the k -club problem seeks a maximum cardinality subset of nodes that induces a subgraph with diameter at most k. We present two new formulations for the 3-club problem: one is compact and the other has a nonpolynomial number of constraints. By defining an integer compact relaxation of the second formulation, we obtain a new upper bound on the 3-club optimum that improves on the 3-clique number bound. We derive new families of valid inequalities for the 3-club polytope and use them to strengthen the LP relaxations of the new models. The computational study is performed on 120 graphs with up to 200 nodes and edge densities reported in the literature to produce difficult instances of the 3-club problem. The results show that the new compact formulation is competitive with the exact solution methods reported in the literature, and that a large proportion of the LP gap is bridged with the new valid inequalities. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.