Pages that link to "Item:Q764323"

The following pages link to Improved approximability and non-approximability results for graph diameter decreasing problems (Q764323):

Displaying 24 items.

• 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)
• Algorithms for radius-optimally augmenting trees in a metric space (Q832891) (← links)
• Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
• Almost optimal algorithms for diameter-optimally augmenting trees (Q2167895) (← links)
• Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
• Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
• A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
• Augmenting Outerplanar Graphs to Meet Diameter Requirements (Q2862552) (← links)
• A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
• Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
• A Linear-Time Algorithm for Discrete Radius Optimally Augmenting Paths in a Metric Space (Q5012871) (← links)
• (Q5091032) (← links)
• (Q5136224) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← 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)
• Algorithms for radius-optimally augmenting trees in a metric space (Q6110070) (← links)
• Augmenting graphs to minimize the radius (Q6114475) (← links)
• Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)