Skip to content
conftrace_

max cut

6 papers

Explore in graph

Co-occurring keywords · papers mentioning both

maximum independent set (2) approximation algorithm (2) max-cut problem (1) polynomial local search (1) max clique (1) max independent set (1) feature-aware (1) hierarchical (1) pooling (1) ε-prediction (1)

Papers

Finding One Local Optimum Is Easy—but What About Two? AAAI 2026 Improved Approximations for Hard Graph Problems using Predictions ICML 2025 Learning to Explore and Exploit with GNNs for Unsupervised Combinatorial Optimization ICLR 2025 MaxCutPool: differentiable feature-aware Maxcut for pooling in graph neural networks ICLR 2025 Parameterized Local Search for Max c-Cut IJCAI 2023 An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints COLT 2020