Approximation algorithms for Euler genus and related problems

DOI10.1109/FOCS.2013.26MaRDI QIDQ6981759zbMATH OpenFDO

Authors Chandra Chekuri, Anastasios Sidiropoulos

Publication date 20 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2013.26

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(1)

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

This page was built for publication: Approximation algorithms for Euler genus and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981759)