ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Minimum Fill-In: Inapproximability and Almost Tight Lower Bounds
Article URLs:
Alternative Article URLs:
Authors: Yixin Cao
  • Hong Kong Polytechnic University, Department of Computing
R. B. Sandeep
  • Indian Institute of Technology Hyderabad, Department of Computer Science and Engineering
  • Hungarian Academy of Sciences, Institute for Computer Science and Control
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/0001S17
Author Comments:

Discuss this paper and its artifacts below