"np-hard problems" Papers
10 papers found
Conference
Balancing Bias in Two-sided Markets for Fair Stable Matchings
Siyuan Wu, Leong Hou U, Panagiotis Karras
ICLR 2025
Eliminating Majority Illusion Is Easy
Jack Dippel, Max Dupré la Tour, April Niu et al.
AAAI 2025paperarXiv:2407.20187
1
citations
Proportionally Fair Matching via Randomized Rounding
Sharmila Duppala, Nathaniel Grammel, Juan Luque et al.
AAAI 2025paperarXiv:2412.11238
Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
Vicente Balmaseda, Ying Xu, Yixin Cao et al.
ICML 2024arXiv:2404.16131
7
citations
Graph-Triggered Rising Bandits
Gianmarco Genalti, Marco Mussi, Nicola Gatti et al.
ICML 2024
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
4
citations
Multi-Sender Persuasion: A Computational Perspective
Safwan Hossain, Tonghan Wang, Tao Lin et al.
ICML 2024arXiv:2402.04971
14
citations
Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
ICML 2024arXiv:2402.02062
5
citations
Partial Optimality in the Linear Ordering Problem
David Stein, Bjoern Andres
ICML 2024
The Computational Complexity of Finding Second-Order Stationary Points
Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos et al.
ICML 2024