A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs.
Julia ChuzhoyZihan TanPublished in: CoRR (2022)
Keyphrases
- undirected graph
- polynomial time complexity
- random graphs
- low degree
- cost function
- graph clustering
- graph structure
- learning algorithm
- weighted graph
- computational complexity
- finding the shortest path
- spanning tree
- theoretical analysis
- worst case
- np hard
- learning theory
- edge weights
- graph construction
- special case
- optimal solution