Pages that link to "Item:Q6110070"

The following pages link to Algorithms for radius-optimally augmenting trees in a metric space (Q6110070):

Displaying 9 items.

• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
• LP-relaxations for tree augmentation (Q1706120) (← links)
• Resilient \(k\)-d trees: \(k\)-means in space revisited (Q1762186) (← links)
• Algorithms for improving the quality of \(R\)-trees (Q1779948) (← links)
• Minimizing the continuous diameter when augmenting a geometric tree with a shortcut (Q2206728) (← links)
• (Q5111750) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees (Q5384465) (← links)
• A linear-time algorithm for radius-optimally augmenting paths in a metric space (Q5918103) (← links)
• Augmenting graphs to minimize the radius (Q6114475) (← links)