Merge branch 'main' of https://github.com/CodingThrust/problem-reductions

Author: GiggleLiu

docs/paper/reductions.typ

@@ -449,6 +449,17 @@ @article{heldkarp1962
   doi     = {10.1137/0110015}
 }
 
+@article{gilmore1964,
+  author  = {P. C. Gilmore and R. E. Gomory},
+  title   = {Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem},
+  journal = {Operations Research},
+  volume  = {12},
+  number  = {5},
+  pages   = {655--679},
+  year    = {1964},
+  doi     = {10.1287/opre.12.5.655}
+}
+
 @article{beigel2005,
   author  = {Richard Beigel and David Eppstein},
   title   = {3-Coloring in Time {$O(1.3289^n)$}},
@@ -1068,6 +1079,27 @@ @article{frederickson1979
   doi     = {10.1145/322139.322150}
 }
 
+@article{frederickson1978routing,
+  author  = {Greg N. Frederickson and Matthew S. Hecht and Chul E. Kim},
+  title   = {Approximation Algorithms for Some Routing Problems},
+  journal = {SIAM Journal on Computing},
+  volume  = {7},
+  number  = {2},
+  pages   = {178--193},
+  year    = {1978},
+  doi     = {10.1137/0207017}
+}
+
+@article{fredericksonguan1993,
+  author  = {Greg N. Frederickson and Da-Wei Guan},
+  title   = {Nonpreemptive Ensemble Motion Planning on a Tree},
+  journal = {Journal of Algorithms},
+  volume  = {15},
+  number  = {1},
+  pages   = {29--60},
+  year    = {1993}
+}
+
 @article{gottlob2002,
   author  = {Georg Gottlob and Nicola Leone and Francesco Scarcello},
   title   = {Hypertree Decompositions and Tractable Queries},
@@ -1282,3 +1314,22 @@ @inproceedings{williams2002
   pages     = {299--307},
   year      = {2002}
 }
+
+@article{papadimitriou1976edge,
+  author  = {Christos H. Papadimitriou},
+  title   = {On the Complexity of Edge Traversing},
+  journal = {Journal of the ACM},
+  volume  = {23},
+  number  = {3},
+  pages   = {544--554},
+  year    = {1976}
+}
+
+@article{edmondsjohnson1973,
+  author  = {Jack Edmonds and Ellis L. Johnson},
+  title   = {Matching, Euler Tours and the Chinese Postman},
+  journal = {Mathematical Programming},
+  volume  = {5},
+  pages   = {88--124},
+  year    = {1973}
+}

docs/paper/references.bib

@@ -216,7 +216,7 @@ TIP: Run `pred create <PROBLEM>` (no other flags) to see problem-specific help.
 
 Flags by problem type:
   MIS, MVC, MaxClique, MinDomSet  --graph, --weights
-  MaxCut, MaxMatching, TSP        --graph, --edge-weights
+  MaxCut, MaxMatching, TSP, BottleneckTravelingSalesman --graph, --edge-weights
   ShortestWeightConstrainedPath   --graph, --edge-lengths, --edge-weights, --source-vertex, --target-vertex, --length-bound, --weight-bound
   MaximalIS                       --graph, --weights
   SAT, NAESAT                     --num-vars, --clauses
@@ -231,6 +231,7 @@ Flags by problem type:
   GeneralizedHex                  --graph, --source, --sink
   MinimumCutIntoBoundedSets       --graph, --edge-weights, --source, --sink, --size-bound, --cut-bound
   HamiltonianCircuit, HC          --graph
+  LongestCircuit                  --graph, --edge-weights, --bound
   BoundedComponentSpanningForest  --graph, --weights, --k, --bound
   UndirectedTwoCommodityIntegralFlow --graph, --capacities, --source-1, --sink-1, --source-2, --sink-2, --requirement-1, --requirement-2
   IsomorphicSpanningTree          --graph, --tree
@@ -265,7 +266,9 @@ Flags by problem type:
   SequencingWithinIntervals       --release-times, --deadlines, --lengths
   OptimalLinearArrangement        --graph, --bound
   MinMaxMulticenter (pCenter)     --graph, --weights, --edge-weights, --k, --bound
+  MixedChinesePostman (MCPP)      --graph, --arcs, --edge-weights, --arc-costs, --bound [--num-vertices]
   RuralPostman (RPP)              --graph, --edge-weights, --required-edges, --bound
+  StackerCrane                    --arcs, --graph, --arc-costs, --edge-lengths, --bound [--num-vertices]
   MultipleChoiceBranching         --arcs [--weights] --partition --bound [--num-vertices]
   AdditionalKey                   --num-attributes, --dependencies, --relation-attrs [--known-keys]
   ConsistencyOfDatabaseFrequencyTables --num-objects, --attribute-domains, --frequency-tables [--known-values]
@@ -498,7 +501,7 @@ pub struct CreateArgs {
     /// Required edge indices for RuralPostman (comma-separated, e.g., "0,2,4")
     #[arg(long)]
     pub required_edges: Option<String>,
-    /// Upper bound or length bound (for BoundedComponentSpanningForest, LengthBoundedDisjointPaths, LongestCommonSubsequence, MultipleCopyFileAllocation, MultipleChoiceBranching, OptimalLinearArrangement, RuralPostman, ShortestCommonSupersequence, or StringToStringCorrection)
+    /// Bound parameter (lower bound for LongestCircuit; upper or length bound for BoundedComponentSpanningForest, LengthBoundedDisjointPaths, LongestCommonSubsequence, MultipleCopyFileAllocation, MultipleChoiceBranching, OptimalLinearArrangement, RuralPostman, ShortestCommonSupersequence, or StringToStringCorrection)
     #[arg(long, allow_hyphen_values = true)]
     pub bound: Option<i64>,
     /// Upper bound on total path length
@@ -849,4 +852,22 @@ mod tests {
         assert!(help.contains("--potential-edges"));
         assert!(help.contains("--budget"));
     }
+
+    #[test]
+    fn test_create_help_mentions_stacker_crane_flags() {
+        let cmd = Cli::command();
+        let create = cmd.find_subcommand("create").expect("create subcommand");
+        let help = create
+            .get_after_help()
+            .expect("create after_help")
+            .to_string();
+
+        assert!(help.contains("StackerCrane"));
+        assert!(help.contains("--arcs"));
+        assert!(help.contains("--graph"));
+        assert!(help.contains("--arc-costs"));
+        assert!(help.contains("--edge-lengths"));
+        assert!(help.contains("--bound"));
+        assert!(help.contains("--num-vertices"));
+    }
 }