/explore
|
You are here 
|
lucatrevisan.wordpress.com | ||
| | | | |
nickhar.wordpress.com
|
|
| | | | | The algorithm for probabilistically embedding metric spaces into trees has numerous theoretical applications. It is a key tool in the design of many approximation algorithms and online algorithms. Today we will illustrate the usefulness of these trees in designing an algorithm for the online Steiner tree problem. 1. Online Steiner Tree Let $latex {G=(V,E)}&fg=000000$ be... | |
| | | | |
jeremykun.com
|
|
| | | | | Hard to believe Sanjeev Arora and his coauthors consider it"a basic tool [that should be] taught to all algorithms students together with divide-and-conquer, dynamic programming, and random sampling."Christos Papadimitriou calls it"so hard to believe that it has been discovered five times and forgotten." It has formed the basis of algorithms inmachine learning, optimization, game theory, | |
| | | | |
blogs.princeton.edu
|
|
| | | | | [latexpage] Sum of squares optimization is an active area of research at the interface of algorithmic algebra and convex optimization. Over the last decade, it has made significant impact on both d... | |
| | | | |
vitalyobukhov.wordpress.com
|
|
| | | Visit the post for more. | ||
