Applying partial differential equations on networks to approximate the Max-Cut and Max-K-Cut problems
The Max-Cut and Max-K-Cut problems are well known combinatorial optimization problems. In this thesis we produce fast approximation methods for these problems by applying methods from partial differential equations on networks. Given a graph G, a cut is a partition of the vertex set of G into two...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/61492/ |