Tag Archives: VC<=3

Protected: External Macro Data Compression

Posted on July 11, 2017 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix: Storage and Retrieval

Tagged Difficulty 8, External Macro Data Compression, SR22, VC<=3

Protected: Shortest Common Superstring

Posted on April 12, 2017 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix: Storage and Retrieval

Tagged Shortest Common Supersequence, Shortest Common Superstring, SR9, VC<=3

Protected: Min-Max Multicenter

Posted on October 4, 2016 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Network Design

Tagged Difficulty 3, Dominating Set, Min-Max Multicenter, VC<=3, Vertex Cover

Protected: Minimizing Dummy Activities in PERT Networks

Posted on August 2, 2016 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Network Design

Tagged Difficulty 7, Minimizing Dummy Activities in PERT Networks, ND44, VC<=3

Protected: Minimum Maximal Matching

Posted on September 9, 2014 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix-Graph Theory

Tagged Difficulty 8, MMM, reductions, VC<=3

Protected: Vertex Cover on Graphs of Degree <=3

Posted on August 27, 2014 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix-Graph Theory, Problems not in appendix

Tagged 3-sat, Difficulty 9, reductions, VC<=3, Vertex Cover