On solving the densestk-subgraph problem on large graphs (Q5859000): Difference between revisions

@@ Property / cites work @@
+Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation
+Normal rank
@@ Property / cites work @@
+Nuclear norm minimization for the planted clique and biclique problems
+Normal rank
@@ Property / cites work @@
+Linear Programming in O([n3/ln n]L) Operations
@@ Property / cites work: Linear Programming in O([n3/ln n]L) Operations / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Dense Subgraphs with Size Bounds
@@ Property / cites work: Finding Dense Subgraphs with Size Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Detecting high log-densities
@@ Property / cites work: Detecting high log-densities / rank @@
+Normal rank
@@ Property / cites work @@
+Different Formulations for Solving the Heaviest<i>K</i>-Subgraph Problem
+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 @@
+Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
+Normal rank
@@ Property / cites work @@
+Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the heaviest \(k\)-subgraph
+Normal rank
@@ Property / cites work @@
+An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
+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 @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
+Normal rank
@@ Property / cites work @@
+\(k\)-edge subgraph problems
@@ Property / cites work: \(k\)-edge subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q3983251
@@ Property / cites work: Q3983251 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4197641
@@ Property / cites work: Q4197641 / rank @@
+Normal rank
@@ Property / cites work @@
+Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
+Normal rank
@@ Property / cites work @@
+Good solutions to discrete noxious location problems via metaheuristics
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q3873927
@@ Property / cites work: Q3873927 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster
+Normal rank
@@ Property / cites work @@
+Solving \(k\)-cluster problems to optimality with semidefinite programming
+Normal rank
@@ Property / cites work @@
+An application of tabu search heuristic for the maximum edge-weighted subgraph problem
+Normal rank
@@ Property / cites work @@
+Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
+Normal rank
@@ Property / cites work @@
+Subgradient methods for huge-scale optimization problems
+Normal rank
@@ Property / cites work @@
+Random block coordinate descent methods for linearly constrained optimization over networks
+Normal rank
@@ Property / cites work @@
+PTAS for densest \(k\)-subgraph in interval graphs
+Normal rank
@@ Property / cites work @@
+Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
+Normal rank
@@ Property / cites work @@
+Heuristic and Special Case Algorithms for Dispersion Problems
+Normal rank
@@ Property / cites work @@
+Semidefinite relaxations for partitioning, assignment and ordering problems
+Normal rank
@@ Property / cites work @@
+Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
+Normal rank
@@ Property / cites work @@
+Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
+Normal rank

On solving the densest<i>k</i>-subgraph problem on large graphs (Q5859000): Difference between revisions

Latest revision as of 00:28, 25 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)