The Optimal Design of Low-Latency Virtual Backbones (Q5148180): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1287/ijoc.2019.0914
+Normal rank
@@ Property / OpenAlex ID @@
+W3016302887
@@ Property / OpenAlex ID: W3016302887 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic construction of sets for             <i>k</i>             -restrictions
+Normal rank
@@ Property / cites work @@
+Length-bounded cuts and flows
@@ Property / cites work: Length-bounded cuts and flows / rank @@
+Normal rank
@@ Property / cites work @@
+On connected dominating sets of restricted diameter
+Normal rank
@@ Property / cites work @@
+An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
+Normal rank
@@ Property / cites work @@
+The regenerator location problem
@@ Property / cites work: The regenerator location problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Generalized Regenerator Location Problem
@@ Property / cites work: The Generalized Regenerator Location Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Connected dominating set. Theory and applications
@@ Property / cites work: Connected dominating set. Theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Thinning out Steiner trees: a node-based model for uniform edge costs
+Normal rank
@@ Property / cites work @@
+The maximum-leaf spanning tree problem: Formulations and facets
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+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 @@
+Fault diameter of interconnection networks
@@ Property / cites work: Fault diameter of interconnection networks / rank @@
+Normal rank
@@ Property / cites work @@
+Construction of strongly connected dominating sets in asymmetric multihop wireless networks
+Normal rank
@@ Property / cites work @@
+Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
+Normal rank
@@ Property / cites work @@
+Mengerian theorems for paths of bounded length
@@ Property / cites work: Mengerian theorems for paths of bounded length / rank @@
+Normal rank
@@ Property / cites work @@
+Reformulations and solution algorithms for the maximum leaf spanning tree problem
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Using separation algorithms to generate mixed integer model reformulations
+Normal rank
@@ Property / cites work @@
+Q2941638
@@ Property / cites work: Q2941638 / rank @@
+Normal rank
@@ Property / cites work @@
+Max flows in O(nm) time, or better
@@ Property / cites work: Max flows in O(nm) time, or better / rank @@
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+Parsimonious formulations for low-diameter clusters
+Normal rank
@@ Property / cites work @@
+On the facial structure of the set covering polytope
+Normal rank
@@ Property / cites work @@
+On dominating sets whose induced subgraphs have a bounded diameter
+Normal rank
@@ Property / cites work @@
+Diameter increase caused by edge deletion
@@ Property / cites work: Diameter increase caused by edge deletion / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
+Normal rank
@@ Property / cites work @@
+Integer priority queues with decrease key in constant time and the single source shortest paths problem
+Normal rank
@@ Property / cites work @@
+Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
+Normal rank
@@ Property / cites work @@
+Q4435203
@@ Property / cites work: Q4435203 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault diameter of Cartesian product graphs
@@ Property / cites work: Fault diameter of Cartesian product graphs / rank @@
+Normal rank