Improved approximations for shallow-light spanning trees

Keyphrases

• Improved Approximation 100%
• Directed Graph 100%
• Path Length 100%
• Spanning Tree 100%
• Shallow-light Trees 100%
• Network Design 50%
• Optimization Problem 50%
• Cost Function 50%
• Information Retrieval 50%
• VLSI Design 50%
• Multi-criteria Optimization 50%
• Edge Length 50%
• Undirected Graph 50%
• Minimum Spanning Tree 50%
• Polynomial-time Algorithm 50%
• Edge Weight 50%
• Approximation Factor 50%
• Design Retrieval 50%

Computer Science

• Approximation (Algorithm) 100%
• Directed Graphs 100%
• Spanning Tree 100%
• Optimization Problem 33%
• Polynomial Time Algorithm 33%
• approximation factor 33%
• Information Retrieval 33%

Mathematics

• Spanning Tree 100%
• Path Length 66%
• Edge 33%
• Cost Function 33%
• Polynomial Time 33%
• Bicriteria 33%