Login / Signup
On the $\mathcal{NP}$-hardness of GRacSim Drawing and k-SEFE Problems.
Luca Grilli
Published in:
CoRR (2016)
Keyphrases
</>
np hardness
np hard
optimization problems
worst case analysis
linear program
convex hull
approximation algorithms
discrete tomography