PDF-On the Hardness of Approximating Minimization Problems CARSTEN LUND AND MIHALIS YANNAKAKIS
Author : faustina-dinatale | Published Date : 2015-01-14
We prove results indicating that it is hard to compute efficiently good approximate solutions to the Graph Coloring Set Covering and other related minimization problems
Presentation Embed Code
Download Presentation
Download Presentation The PPT/PDF document "On the Hardness of Approximating Minimiz..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
On the Hardness of Approximating Minimization Problems CARSTEN LUND AND MIHALIS YANNAKAKIS: Transcript
Download Document
Here is the link to download the presentation.
"On the Hardness of Approximating Minimization Problems CARSTEN LUND AND MIHALIS YANNAKAKIS"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.
Related Documents
