A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms.
Maleq KhanGopal PanduranganV. S. Anil KumarPublished in: Theor. Comput. Sci. (2007)
Keyphrases
- data structure
- learning algorithm
- black box
- benchmark datasets
- computational complexity
- significant improvement
- combinatorial optimization
- distributed systems
- partitioning schemes
- machine learning
- distributed computation
- times faster
- machine learning algorithms
- optimization problems
- computational cost
- search algorithm
- cooperative
- multi agent