专题：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.
最新文献
近5年高被引文献
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks

article Full Text OpenAlex 5184 FWCI320.0427

Proceedings of the 56th Annual ACM Symposium on Theory of Computing

paratext Full Text OpenAlex 1730 FWCI0

Introduction to Algorithms

book-chapter Full Text OpenAlex 1614 FWCI477.1554

A Note on Two Problems in Connexion with Graphs

book-chapter Full Text OpenAlex 1354 FWCI553.8179

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem

article Full Text OpenAlex 1131 FWCI23.3528

Proceedings of the 55th Annual ACM Symposium on Theory of Computing

paratext Full Text OpenAlex 587 FWCI0

Discovering faster matrix multiplication algorithms with reinforcement learning

article Full Text OpenAlex 478 FWCI51.1658

Influence-Based Community Partition With Sandwich Method for Social Networks

article Full Text OpenAlex 265 FWCI6.7235

Centrality measures in networks

article Full Text OpenAlex 232 FWCI20.3267

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

article Full Text OpenAlex 228 FWCI13.7368