A Scalable and Exact Relaxation for Densest $k$-Subgraph via Error Bounds

Documenti analoghi

• Extreme Point Pursuit -- Part II: Further Error Bound Analysis and Applications
  di: Liu, Junbin, et al.
  Pubblicazione: (2024)
• Multilayer Simplex-structured Matrix Factorization for Hyperspectral Unmixing with Endmember Variability
  di: Liu, Junbin, et al.
  Pubblicazione: (2024)
• Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization
  di: Liu, Junbin, et al.
  Pubblicazione: (2024)
• Accelerated and Deep Expectation Maximization for One-Bit MIMO-OFDM Detection
  di: Shao, Mingjie, et al.
  Pubblicazione: (2022)
• The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
  di: Lu, Qiheng, et al.
  Pubblicazione: (2025)