Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764): Difference between revisions

@@ Property / cites work @@
+Finding Dense Subgraphs with Size Bounds
@@ Property / cites work: Finding Dense Subgraphs with Size Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Greedily Finding a Dense Subgraph
@@ Property / cites work: Greedily Finding a Dense Subgraph / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
+Normal rank
@@ Property / cites work @@
+Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland
+Normal rank
@@ Property / cites work @@
+Q4667100
@@ Property / cites work: Q4667100 / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering and domination in perfect graphs
@@ Property / cites work: Clustering and domination in perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+An improved rounding method and semidefinite programming relaxation for graph partition
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum dispersion
@@ Property / cites work: Approximation algorithms for maximum dispersion / rank @@
+Normal rank
@@ Property / cites work @@
+A Lagrangian relaxation approach to the edge-weighted clique problem
+Normal rank
@@ Property / cites work @@
+Q3983251
@@ Property / cites work: Q3983251 / rank @@
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+Q4296972
@@ Property / cites work: Q4296972 / rank @@
+Normal rank
@@ Property / cites work @@
+A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
+Normal rank
@@ Property / cites work @@
+The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
+Normal rank
@@ Property / cites work @@
+Upper bounds and exact algorithms for \(p\)-dispersion problems
+Normal rank
@@ Property / cites work @@
+New facets and a branch-and-cut algorithm for the weighted clique problem.
+Normal rank