专题：Combinatorial Optimization and Complexity Theory

This cluster of papers focuses on combinatorial optimization, approximation algorithms, complexity theory, graph algorithms, submodular functions, network flows, matrix multiplication, communication complexity, linear programming, and algorithmic applications.
最新文献
Maximization of Approximately Submodular Functions

preprint Full Text OpenAlex

Long directed detours: Reduction to 2-Disjoint Paths

article Full Text OpenAlex

Flow-augmentation II: Undirected Graphs

article Full Text OpenAlex

HyLAC: Hybrid linear assignment solver in CUDA

article Full Text OpenAlex

Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint

article Full Text OpenAlex

Fault-tolerant identity-based encryption from SM9

article Full Text OpenAlex

Welfare maximization in stable sharing services

article Full Text OpenAlex

Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs

article Full Text OpenAlex

Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs

article Full Text OpenAlex

Learning-augmented maximum flow

article Full Text OpenAlex

近5年高被引文献
Privacy-Preserving Machine Learning With Fully Homomorphic Encryption for Deep Neural Network

article Full Text OpenAlex 316 FWCI60.89343311

Warm-starting quantum optimization

article Full Text OpenAlex 239 FWCI25.68085068

Indistinguishability obfuscation from well-founded assumptions

article Full Text OpenAlex 213 FWCI21.72995057

The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size

article Full Text OpenAlex 210 FWCI36.02698293

Survey on Fully Homomorphic Encryption, Theory, and Applications

article Full Text OpenAlex 187 FWCI36.61437939

Algorithms and Complexity

book-chapter Full Text OpenAlex 136 FWCI4.63248502

On the Security of Homomorphic Encryption on Approximate Numbers

book-chapter Full Text OpenAlex 134 FWCI32.57069367

Formulating and Solving Routing Problems on Quantum Computers

article Full Text OpenAlex 131 FWCI14.39256467

BTS

article Full Text OpenAlex 122 FWCI23.88745608

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

article Full Text OpenAlex 121 FWCI29.68713015