A unifying model for locally constrained spanning tree problems (Q2045044): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-021-00740-2
@@ Property / DOI: 10.1007/s10878-021-00740-2 / rank @@
-Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
+Normal rank
@@ Property / cites work @@
+md-MST is NP-hard for
@@ Property / cites work: md-MST is NP-hard for / rank @@
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
+Normal rank
@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-angle spanning tree: modeling networks with angular constraints
+Normal rank
@@ Property / cites work @@
+Q5111862
@@ Property / cites work: Q5111862 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Q4260373
@@ Property / cites work: Q4260373 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of spanning tree problems: Part I
@@ Property / cites work: Complexity of spanning tree problems: Part I / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding multi-constrained spanning trees
+Normal rank
@@ Property / cites work @@
+Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Modeling and solving the angular constrained minimum spanning tree problem
+Normal rank
@@ Property / cites work @@
+Determining a Minimum Spanning Tree with Disjunctive Constraints
+Normal rank
@@ Property / cites work @@
+Paths, trees and matchings under disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Q4363166
@@ Property / cites work: Q4363166 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Online variable-sized bin packing with conflicts
@@ Property / cites work: Online variable-sized bin packing with conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+On the minimum diameter spanning tree problem
@@ Property / cites work: On the minimum diameter spanning tree problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Diameter Spanning Trees and Related Problems
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Trees in Graphs with Conflict Edges or Forbidden Transitions
+Normal rank
@@ Property / cites work @@
+Approximating the degree-bounded minimum diameter spanning tree problem
+Normal rank
@@ Property / cites work @@
+Comparison of algorithms for the degree constrained minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum acyclic subgraph problem under disjunctive constraints
+Normal rank
@@ Property / cites work @@
+The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+On two geometric problems related to the travelling salesman problem
+Normal rank
@@ Property / cites work @@
+The maximum flow problem with disjunctive constraints
+Normal rank
@@ Property / cites work @@
+Low-degree minimum spanning trees
@@ Property / cites work: Low-degree minimum spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A branch and cut algorithm for minimum spanning trees under conflict constraints
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
+Normal rank
@@ Property / cites work @@
+Two dependency constrained spanning tree problems
@@ Property / cites work: Two dependency constrained spanning tree problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum spanning tree problem with conflict constraints and its variations
+Normal rank
@@ Property / DOI @@
+.1007/S10878-021-00740-2
@@ Property / DOI: 10.1007/S10878-021-00740-2 / rank @@
+Normal rank