We give an approximation scheme for the TSP in $d$-dimensional hyperbolic space that has nearly optimal dependence on $\varepsilon$ under SH. For any fixed dimension $d\geq 2$ and for any $\varepsilon>0$ our randomized algorithm gives a $(1+\varepsilon)$-approximation in time $2^{O(1/\varepsilon^{d-1})}n^{1+o(1)}$. We also provide an algorithm for the hyperbolic Steiner tree problem with the same running …
Seminars and Colloquiums
Events
Calendar of Events
|
Sunday
|
Monday
|
Tuesday
|
Wednesday
|
Thursday
|
Friday
|
Saturday
|
|---|---|---|---|---|---|---|
|
0 events,
|
0 events,
|
1 event,
-
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
In the 1980s, Ron Graham asked whether every red/blue coloring of the positive integers contains a monochromatic Pythagorean triple and offered a $100 prize for the answer. The bounty was claimed in 2016 by Heule, Kullmann, and Marek, who showed that every such coloring of has a monochromatic triple. Their proof used SAT solvers and … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
1 event,
-
For any graph with maximum degree at most $\Delta$, a simple inductive argument shows that the graph can be properly colored using $\Delta+1$ colors. However, a direct implementation of this argument is highly sequential, motivating extensive research into efficient algorithms in parallel, distributed, and dynamic settings. In this talk, I will present a simple randomized … |
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|
0 events,
|

