Parsimonious formulations for low-diameter clusters
From MaRDI portal
Publication:2220903
\(k\)-clubbounded diameterclusterdistance constrainthop constraintinteger programminglength-bounded cutlow-diameter
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30)
Recommendations
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Integer models and upper bounds for the 3-club problem
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Upper bounds and heuristics for the 2-club problem
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
Cites work
- A graph‐theoretic definition of a sociometric clique†
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
- Algorithms for the maximum k-club problem in graphs
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- An integer programming approach for fault-tolerant connected dominating sets
- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Distance-based clique relaxations in networks: s-clique and s-club
- Fast algorithms for determining (generalized) core groups in social networks
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Geometric algorithms and combinatorial optimization.
- Heuristics for finding \(k\)-clubs in an undirected graph
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 1424314 (Why is no real title available?)
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- Imposing Connectivity Constraints in Forest Planning Models
- Integer models and upper bounds for the 3-club problem
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Length-bounded cuts and flows
- Max flows in O(nm) time, or better
- Mengerian theorems for paths of bounded length
- Minimum degree orderings
- Novel approaches for analyzing biological networks
- On clique relaxation models in network analysis
- On imposing connectivity constraints in integer programs
- On inclusionwise maximal and maximum cardinality k-clubs in graphs
- On the 2-club polytope of graphs
- On the complexity of k-SAT
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- Smallest-last ordering and clustering and graph coloring algorithms
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Using separation algorithms to generate mixed integer model reformulations
- Which problems have strongly exponential complexity?
Cited in
(21)- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Political districting to minimize cut edges
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- Graph signatures: identification and optimization
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Developing the Inparcom family of cluster complexes
- Advantage of Overlapping Clusters for Minimizing Conductance
- Identifying large robust network clusters via new compact formulations of maximum k-club problems
- Parsimonious cluster systems
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Imposing contiguity constraints in political districting models
- Solving the Distance-Based Critical Node Problem
- Approximating maximum diameter-bounded subgraph in unit disk graphs
- The optimal design of low-latency virtual backbones
- Integer models and upper bounds for the 3-club problem
- Highly efficient stepped wedge designs for clusters of unequal size
- A hybrid solution method for the bi-objective traffic counting location problem using previous origin-destination trip tables
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
- Finding conserved low-diameter subgraphs in social and biological networks
- A dynamic programming algorithm for the maximum s-club problem on trees
- Finding maximum weight 2-packing sets on arbitrary graphs
This page was built for publication: Parsimonious formulations for low-diameter clusters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220903)
