The following pages link to Andreas Karrenbauer (Q500991):
Displaying 5 items.
- The interval constrained 3-coloring problem (Q500992) (← links)
- A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm (Q613330) (← links)
- Approximation algorithms for the interval constrained coloring problem (Q639285) (← links)
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (Q5327457) (← links)
- Near-optimal approximate shortest paths and transshipment in distributed and streaming models (Q6487479) (← links)
