Pages that link to "Item:Q3580979"

The following pages link to Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979):

Displayed 5 items.

• Local MST computation with short advice (Q613116) ‎ (← links)
• Fast deterministic distributed algorithms for sparse spanners (Q930906) ‎ (← links)
• A fast distributed approximation algorithm for minimum spanning trees (Q1954259) ‎ (← links)
• A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms (Q2456363) ‎ (← links)
• Distributed MST for constant diameter graphs (Q5919895) ‎ (← links)