Efficient polynomial-time approximation scheme for the genus of dense graphs.

Yifan Jing Bojan Mohar

Published in: CoRR (2020)

Keyphrases

polynomial time approximation
np hard
approximation algorithms
error bounds
special case
bin packing
graph matching
approximation guarantees
optimal solution
scheduling problem
integer programming
graph theory
graph databases