Login / Signup
A Simpler NP-Hardness Proof for Familial Graph Compression.
Ammar Ahmed
Zohair Raza Hassan
Mudassir Shabbir
Published in:
CoRR (2020)
Keyphrases
</>
np hardness
np hard
approximation algorithms
worst case analysis
compression ratio
discrete tomography
mixed integer
compression algorithm
image compression
directed acyclic graph
mobile robot
linear programming
directed graph