Pages that link to "Item:Q1196217"

The following pages link to On the minimum-cardinality-bounded-diameter and the bounded-cardinality- minimum-diameter edge addition problems (Q1196217):

Displaying 32 items.

• Optimizing budget allocation for center and median points (Q265070) (← links)
• Network design for time-constrained delivery using subgraphs (Q395697) (← links)
• On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph (Q429689) (← links)
• Augmenting graphs to minimize the diameter (Q494792) (← links)
• Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
• Shortcuts for the circle (Q670711) (← links)
• Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323) (← links)
• Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
• Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks (Q2015788) (← links)
• Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
• Relaxed and approximate graph realizations (Q2115836) (← links)
• Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
• The parametric complexity of graph diameter augmentation (Q2446345) (← links)
• Augmenting forests to meet odd diameter requirements (Q2506822) (← links)
• Mathematical programming models for some smallest-world problems (Q2572112) (← links)
• Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
• Augmenting outerplanar graphs to meet diameter requirements (Q2862552) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
• A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
• (Q5091032) (← links)
• (Q5136224) (← links)
• Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
• Mixed covering of trees and the augmentation problem with odd diameter constraints (Q5899375) (← links)
• An improved algorithm for diameter-optimally augmenting paths in a metric space (Q5915544) (← links)
• A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103) (← links)
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
• Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches (Q6070501) (← links)
• Augmenting graphs to minimize the radius (Q6114475) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
• Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)