Outer Web | Explore

Explore >> Select a destination

You are here		algorithmsoup.wordpress.com The World's Simplest Interesting Algorithm - Algorithm Soup
\|	\|	cambridge163.wordpress.com First blog post - cambridge163	2.1 parsecs away Travel
\|	\|	This is the excerpt for your very firstpost.	2.1 parsecs away Travel
\|	\|	nickhar.wordpress.com Lecture 25: Online Steiner Tree \| UBC CPSC 536N	2.0 parsecs away Travel
\|	\|	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...	2.0 parsecs away Travel
\|	\|	dominiczypen.wordpress.com Making critical graphs as regular as possible \| Musings on general topology and orderings	1.4 parsecs away Travel
\|	\|	Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$...	1.4 parsecs away Travel
\|	\|	wordrefiner.wordpress.com Ads from long ago \| wordrefiner	6.0 parsecs away Travel
\|		https://bluebirdofbitterness.com/2024/02/20/advertisements-from-long-long-ago-winter-wonderland-edition/?page_id=104602	6.0 parsecs away Travel