✦ LIBER ✦

Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem

✍ Scribed by Balasundaram, Balabhaskar; Butenko, Sergiy; Hicks, Illya V.

Book ID: 118269181
Publisher: INFORMS
Year: 2011
Tongue: English
Weight: 149 KB
Volume: 59
Category: Article
ISSN: 0030-364X
DOI: 10.1287/opre.1100.0851

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of the greedy approach in probl

Analysis of the greedy approach in problems of maximum k-coverage

✍ Dorit S. Hochbaum; Anu Pathria 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

In this paper, we consider a general covering problem in which k subsets are to be selected such that their union covers as large a weight of objects from a universal set of elements as possible. Each subset selected must satisfy some structural constraints. We analyze the quality of a k-stage cover

Probabilistic analysis of an lp relaxati

Probabilistic analysis of an lp relaxation bound for the steiner problem in networks

✍ Anjani Jain 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 395 KB

AnO(m + n log n) Alg

AnO(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

✍ Binay K. Bhattacharya; Damon Kaller 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 338 KB

We present an algorithm to compute, in O m q n log n time, a maximum clique Ž . in circular-arc graphs with n vertices and m edges provided a circular-arc model of the graph is given. If the circular-arc endpoints are given in sorted order, the Ž . time complexity is O m . The algorithm operates on