Exploring the Reductions Between SSP-NP-complete Problems and Developing a Compendium Website Displaying the Results
Femke Pfaue

TL;DR
This paper explores SSP reductions, compiles SSP-NP-complete problems, discovers new reductions, and develops an extendable website to visualize problem relations, aiding researchers in understanding complex problem interconnections.
Contribution
It introduces 19 new SSP reductions, proves 8 new SSP-NP-completeness results, and creates a comprehensive, extendable web-based compendium for SSP problems and reductions.
Findings
19 new SSP reductions identified
8 new SSP-NP-completeness proofs established
Developed an extendable compendium website for SSP problems
Abstract
SSP reductions are a type of polynomial reductions that also preserve the solutions of the instances. This means there is a mapping from each solution in the original instance to one in the reduced instance, allowing direct deduction of an original solution from a solution in the reduced instance. SSP reductions can be used to show SSP-NP completeness of a problem, which is interesting because it has been proven that two min-max variants of SSP-NP complete problems are -complete. Min-max optimization problems are optimization problems with the objective of minimizing the maximum outcome. An example is a power network prone to attack by terrorists. Lets say the government wants to minimize the damage that can be achieved by the terrorists, e.g. by protecting the electricity poles which were found to be most important for distributing power. Most theoretical computer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBIM and Construction Integration
