Combinatorial Optimization using Comparison Oracles
Fuente:
arXiv
Saved in:
| Main Authors: | Cohen-Addad, Vincent, d'Orsi, Tommaso, Gupta, Anupam, Guruganesh, Guru, Lee, Euiwoong, Leme, Renato Paes, Panigrahi, Debmalya, Pittu, Madhusudhan Reddy, Schneider, Jon, Woodruff, David P. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Max-Cut with $ε$-Accurate Predictions
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Complexity of Local Search for CSPs Parameterized by Constraint Difference
by: Anand, Aditya, et al.
Published: (2025)
by: Anand, Aditya, et al.
Published: (2025)
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Multi-View Stochastic Block Models
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Perturb-and-Project: Differentially Private Similarities and Marginals
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Combinatorial Bernoulli Factories
by: Niazadeh, Rad, et al.
Published: (2020)
by: Niazadeh, Rad, et al.
Published: (2020)
On Purely Private Covariance Estimation
by: d'Orsi, Tommaso, et al.
Published: (2025)
by: d'Orsi, Tommaso, et al.
Published: (2025)
Tight Differentially Private PCA via Matrix Coherence
by: d'Orsi, Tommaso, et al.
Published: (2025)
by: d'Orsi, Tommaso, et al.
Published: (2025)
An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)
by: Laddha, Aditi, et al.
Published: (2025)
Qualidade da atenção ao parto em maternidades do Rio de Janeiro
by: Eleonora d’Orsi
Published: (2005)
by: Eleonora d’Orsi
Published: (2005)
Trabalho, suporte social e lazer protegem idosos da perda funcional: estudo epidoso
by: Eleonora d'Orsi
Published: (2011)
by: Eleonora d'Orsi
Published: (2011)
Strongly Refuting Random CSP without Literals
by: Chan, Siu On, et al.
Published: (2026)
by: Chan, Siu On, et al.
Published: (2026)
On Finding Randomly Planted Cliques in Arbitrary Graphs
by: Agrimonti, Francesco, et al.
Published: (2025)
by: Agrimonti, Francesco, et al.
Published: (2025)
Infiltrações intralesionais de 5-FU no tratamento de queloides, cicatrizes hipertróficas e contraturas
by: Leandra d'Orsi Metsavaht
Published: (2015)
by: Leandra d'Orsi Metsavaht
Published: (2015)
Hidroquinona: vilã ou heroína?
by: Leandra d’Orsi Metsavaht
Published: (2017)
by: Leandra d’Orsi Metsavaht
Published: (2017)
Queimaduras e suas cicatrizes
by: Leandra d’Orsi Metsavaht
Published: (2017)
by: Leandra d’Orsi Metsavaht
Published: (2017)
Guessing Efficiently for Constrained Subspace Approximation
by: Bhaskara, Aditya, et al.
Published: (2025)
by: Bhaskara, Aditya, et al.
Published: (2025)
Max-Cut with Multiple Cardinality Constraints
by: Makarychev, Yury, et al.
Published: (2025)
by: Makarychev, Yury, et al.
Published: (2025)
Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)
by: Leme, Renato Paes, et al.
Published: (2022)
Nonbossy Mechanisms: Mechanism Design Robust to Secondary Goals
by: Leme, Renato Paes, et al.
Published: (2023)
by: Leme, Renato Paes, et al.
Published: (2023)
Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
by: Cohen-Addad, Vincent, et al.
Published: (2022)
by: Cohen-Addad, Vincent, et al.
Published: (2022)
Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
by: Brown, Adam, et al.
Published: (2024)
by: Brown, Adam, et al.
Published: (2024)
Solving an Open Problem in Theoretical Physics using AI-Assisted Discovery
by: Brenner, Michael P., et al.
Published: (2026)
by: Brenner, Michael P., et al.
Published: (2026)
“Like a roller‐coaster ride”: Fathers' perspectives about their role in childcare
by: Dora d'Orsi, et al.
Published: (2026)
by: Dora d'Orsi, et al.
Published: (2026)
Bayesian Conversations
by: Leme, Renato Paes, et al.
Published: (2023)
by: Leme, Renato Paes, et al.
Published: (2023)
Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
by: d'Orsi, Tommaso, et al.
Published: (2024)
by: d'Orsi, Tommaso, et al.
Published: (2024)
A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Distributed Algorithms for Euclidean Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2026)
by: Cohen-Addad, Vincent, et al.
Published: (2026)
Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Contracting with a Learning Agent
by: Guruganesh, Guru, et al.
Published: (2024)
by: Guruganesh, Guru, et al.
Published: (2024)
Understanding the Cluster LP for Correlation Clustering
by: Cao, Nairen, et al.
Published: (2024)
by: Cao, Nairen, et al.
Published: (2024)
Complex Dynamics in Autobidding Systems
by: Leme, Renato Paes, et al.
Published: (2024)
by: Leme, Renato Paes, et al.
Published: (2024)
Private graphon estimation via sum-of-squares
by: Chen, Hongjie, et al.
Published: (2024)
by: Chen, Hongjie, et al.
Published: (2024)
An Improved Greedy Approximation for (Metric) $k$-Means
by: Charikar, Moses, et al.
Published: (2026)
by: Charikar, Moses, et al.
Published: (2026)
Combinatorial Correlation Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2024)
by: Cohen-Addad, Vincent, et al.
Published: (2024)
Full Swap Regret and Discretized Calibration
by: Fishelson, Maxwell, et al.
Published: (2025)
by: Fishelson, Maxwell, et al.
Published: (2025)
Contextual Online Bilateral Trade
by: Cosson, Romain, et al.
Published: (2026)
by: Cosson, Romain, et al.
Published: (2026)
Nearly Tight Bounds for the Online Sorting Problem
by: Azar, Yossi, et al.
Published: (2025)
by: Azar, Yossi, et al.
Published: (2025)
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
by: Cohen-Addad, Vincent, et al.
Published: (2025)
by: Cohen-Addad, Vincent, et al.
Published: (2025)
Similar Items
-
Max-Cut with $ε$-Accurate Predictions
by: Cohen-Addad, Vincent, et al.
Published: (2024) -
Complexity of Local Search for CSPs Parameterized by Constraint Difference
by: Anand, Aditya, et al.
Published: (2025) -
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
by: Cohen-Addad, Vincent, et al.
Published: (2024) -
Multi-View Stochastic Block Models
by: Cohen-Addad, Vincent, et al.
Published: (2024) -
Perturb-and-Project: Differentially Private Similarities and Marginals
by: Cohen-Addad, Vincent, et al.
Published: (2024)