"np-hard problems" Papers
8 papers found
Balancing Bias in Two-sided Markets for Fair Stable Matchings
Siyuan Wu, Leong Hou U, Panagiotis Karras
ICLR 2025poster
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao et al.
ICML 2024poster
Graph-Triggered Rising Bandits
Gianmarco Genalti, Marco Mussi, Nicola Gatti et al.
ICML 2024poster
KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum K-defective Clique Problem
Jiongzhi Zheng, Mingming Jin, Kun He
AAAI 2024paperarXiv:2308.07235
Multi-Sender Persuasion: A Computational Perspective
Safwan Hossain, Tonghan Wang, Tao Lin et al.
ICML 2024posterarXiv:2402.04971
Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
ICML 2024poster
Partial Optimality in the Linear Ordering Problem
David Stein, Bjoern Andres
ICML 2024poster
The Computational Complexity of Finding Second-Order Stationary Points
Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos et al.
ICML 2024poster