Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Charles Carlson
Improving the Smoothed Complexity of FLIP for Max Cut Problems
Related publications
Sampling Sub-Problems of Heterogeneous Max-Cut Problems and Approximation Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Advanced Scatter Search for the Max-Cut Problem
INFORMS Journal on Computing
Management Science
Computer Science Applications
Information Systems
Operations Research
Software
Optimization and Optimality Test for the Max-Cut Problem
Mathematical Methods of Operations Research
Management Science
Software
Operations Research
Mathematics
Smoothed Analysis of Condition Numbers and Complexity Implications for Linear Programming
Mathematical Programming, Series B
Mathematics
Software
Two‐stage Stochastic Minimum S − T Cut Problems: Formulations, Complexity and Decomposition Algorithms
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Max Cut for Random Graphs With a Planted Partition
Combinatorics Probability and Computing
Statistics
Probability
Applied Mathematics
Mathematics
Computational Theory
Theoretical Computer Science
An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems With Applications to Approximation Algorithms
QAOA for Max-Cut Requires Hundreds of Qubits for Quantum Speed-Up
Scientific Reports
Multidisciplinary
Partitioning Planar Graphs: A Fast Combinatorial Approach for Max-Cut
Computational Optimization and Applications
Control
Computational Mathematics
Applied Mathematics
Optimization
