← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

SAT-Based Explicit LTLf Satisfiability Checking AAAI 2019
An Innovative Genetic Algorithm for the Quantum Circuit Compilation Problem AAAI 2019
Computational Intractability and Solvability for the Birds of a Feather Game AAAI 2019
A Framework for Approval-Based Budgeting Methods AAAI 2019
Partners in Crime: Manipulating the Deferred Acceptance Algorithm through an Accomplice AAAI 2019
How Similar Are Two Elections? AAAI 2019
Rotational Diversity in Multi-Cycle Assignment Problems AAAI 2019
Long-Distance Dependencies Don’t Have to Be Long: Simplifying through Provably (Approximately) Optimal Permutations ACL 2019
Constraint-based Learning of Phonological Processes EMNLP 2019
Combinatorial Persistency Criteria for Multicut and Max-Cut CVPR 2019
A Convex Relaxation for Multi-Graph Matching CVPR 2019
Learning Erdos-Renyi Random Graphs via Edge Detecting Queries NIPS 2019
Combinatorial Bayesian Optimization using the Graph Cartesian Product NIPS 2019
Adaptive Sequence Submodularity NIPS 2019
Facility Location Problem in Differential Privacy Model Revisited NIPS 2019
Submodular Function Minimization with Noisy Evaluation Oracle NIPS 2019
Correlation clustering with local objectives NIPS 2019
Superset Technique for Approximate Recovery in One-Bit Compressed Sensing NIPS 2019
Flexible Modeling of Diversity with Strongly Log-Concave Distributions NIPS 2019
Approximating the Permanent by Sampling from Adaptive Partitions NIPS 2019
Subquadratic High-Dimensional Hierarchical Clustering NIPS 2019
On Differentially Private Graph Sparsification and Applications NIPS 2019
Interlaced Greedy Algorithm for Maximization of Submodular Functions in Nearly Linear Time NIPS 2019
A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening NIPS 2019
(Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs NIPS 2019