Research map / Learning theory and algorithms / Matrix and tensor methods
A Scalable and Exact Relaxation for Densest k-Subgraph via Error Bounds
Ya Liu, Junbin Liu, Wing-Kin Ma, Aritra Konar
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use error-bound penalty on hypercube with proximal gradient (EP-Prox) instead of convex-hull penalty solvers | EXPP and Lovasz relaxation · DkS on HepTh, CondMat, DBLP, roadNet, Talk, LiveJournal1 | runtime: 2X faster | Improved |
| EP-Prox vs EXPP and Lovasz on solution quality | EP-Prox · DkS six graphs | edge density | No clear effect |
| EP-Prox vs Greedy | EP-Prox · DkS six graphs | edge density | Improved |
| EP-Prox vs Rank-1 PC on bipartite subgraph | EP-Prox · Dk1k2BS (Actor movies, Digg votes, Flickr, Wikipedia edits) | edge density | Improved |
| EP-Prox vs EXPP on bipartite subgraph | EP-Prox · Dk1k2BS | runtime: about an order of magnitude faster | Improved |
Closest papers by meaning
- Densest k-Subgraph Mining via a Provably Tight Relaxation (AAAI 2025 · similarity 0.92)
- Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems (ICML 2024 · similarity 0.88)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.87)
- ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-$k$-Cut Problems (ICML 2025 · similarity 0.86)
- Faster Streaming and Scalable Algorithms for Finding Directed Dense Subgraphs in Large Graphs (ICML 2024 · similarity 0.86)
- KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem (AAAI 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
