Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Category Archives: Appendix- Network Design

Protected: Kth Shortest Path

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 5, Hamiltonian Path, kth shortest path, ND31, Turing Reduction, uncited reduction on April 12, 2016 by Sean T. McCulloch.

Protected: Shortest Weight-Constrained Path

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 5, Part, Shortest Weight-Constrained Path, uncited reduction on April 5, 2016 by Sean T. McCulloch.

Protected: Longest Circuit, Longest Path

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 2, Longest Circuit, Longest Path, ND28, ND29, uncited reduction on March 28, 2016 by Sean T. McCulloch.

Protected: Stacker-Crane

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 4, Difficulty 5, Hamiltonian Circuit, ND26, Rural Postman, Stacker-Crane on March 22, 2016 by Sean T. McCulloch.

Protected: Rural Postman

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 4, Hamiltonian Circuit, ND27, Rural Postman on March 15, 2016 by Sean T. McCulloch.

Protected: Chinese Postman for Mixed Graphs

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged 3-sat, Chinese Postman, Difficulty 9, ND25 on March 7, 2016 by Sean T. McCulloch.

Protected: Geometric Traveling Salesman

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 9, Geometric Steiner Tree, Geometric TSP, ND23, X3C on March 1, 2016 by Sean T. McCulloch.

Protected: Traveling Salesman, Bottleneck Traveling Salesman

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Bottleneck TSP, Difficulty 2, Hamiltonian Circuit, ND22, ND24, TSP on February 22, 2016 by Sean T. McCulloch.

Protected: Biconnectivity Augmentation, Strong Connectivity Augmentation

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Biconnectivity Augmentation, Difficulty 3, Hamiltonian Circuit, ND18, ND19, Strong Connectivity Augmentation on February 16, 2016 by Sean T. McCulloch.

Protected: Minimum Cut Into Bounded Sets

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix- Network Design and tagged Bipartite Subgraph, Difficulty 5, Difficulty 6, Max Cut, Minimum Cut into Bounded Sets, ND16, ND17, Simple Max-Cut on February 9, 2016 by Sean T. McCulloch.

← Older posts

Newer posts →

Search for: