Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398): Difference between revisions

@@ Property / cites work @@
+On minimum reload cost paths, tours, and flows
@@ Property / cites work: On minimum reload cost paths, tours, and flows / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Q3577833
@@ Property / cites work: Q3577833 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of a minimum reload cost diameter problem
+Normal rank
@@ Property / cites work @@
+On Minimum Changeover Cost Arborescences
@@ Property / cites work: On Minimum Changeover Cost Arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum reload cost cycle cover
@@ Property / cites work: On minimum reload cost cycle cover / rank @@
+Normal rank
@@ Property / cites work @@
+Reload cost trees and network design
@@ Property / cites work: Reload cost trees and network design / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum reload \(s-t\) path, trail and walk problems
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of the MinCCA problem on graphs of bounded decomposability
+Normal rank
@@ Property / cites work @@
+Constructing minimum changeover cost arborescenses in bounded treewidth graphs
+Normal rank
@@ Property / cites work @@
+Complexity of edge coloring with minimum reload/changeover costs
+Normal rank
@@ Property / cites work @@
+On the complexity of constructing minimum changeover cost arborescences
+Normal rank
@@ Property / cites work @@
+Bin packing with fixed number of bins revisited
@@ Property / cites work: Bin packing with fixed number of bins revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q2734566
@@ Property / cites work: Q2734566 / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4734791
@@ Property / cites work: Q4734791 / rank @@
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Reload cost problems: Minimum diameter spanning tree
+Normal rank
@@ Property / Wikidata QID @@
+Q126568023
@@ Property / Wikidata QID: Q126568023 / rank @@
+Normal rank