The following pages link to Harald Räcke (Q693766):
Displayed 50 items.
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- Balanced graph partitioning (Q863200) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- (Q1601741) (redirect page) (← links)
- Data management in networks: Experimental evaluation of a provably good strategy (Q1601742) (← links)
- Approximation algorithms for data management in networks (Q1879189) (← links)
- Improved Guarantees for Tree Cut Sparsifiers (Q2921461) (← links)
- (Q2921658) (← links)
- (Q2921660) (← links)
- (Q2921741) (← links)
- (Q2921742) (← links)
- Fast convergence to Wardrop equilibria by adaptive sampling methods (Q2931425) (← links)
- Vertex Sparsification in Trees (Q2971161) (← links)
- (Q3002815) (← links)
- Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces (Q3119488) (← links)
- Smoothed analysis of left-to-right maxima with applications (Q3189072) (← links)
- (Q3549655) (← links)
- (Q3549709) (← links)
- Survey on Oblivious Routing Strategies (Q3576074) (← links)
- (Q3579444) (← links)
- Oblivious routing in directed graphs with random demands (Q3581422) (← links)
- New lower bounds for oblivious routing in undirected graphs (Q3581557) (← links)
- Oblivious network design (Q3581559) (← links)
- Improved embeddings of graph metrics into random trees (Q3581573) (← links)
- (Q4411413) (← links)
- Randomized Pursuit-Evasion in Graphs (Q4471150) (← links)
- Reordering Buffers with Logarithmic Diameter Dependency for Trees (Q4575821) (← links)
- Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering (Q4598180) (← links)
- (Q4601910) (← links)
- An <i>O</i> (log <i>k</i> )-Competitive Algorithm for Generalized Caching (Q4629976) (← links)
- (Q4737218) (← links)
- Oblivious routing on node-capacitated and directed graphs (Q4962691) (← links)
- Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut (Q4962715) (← links)
- (Q5075823) (← links)
- (Q5111364) (← links)
- Online Stochastic Reordering Buffer Scheduling (Q5167765) (← links)
- Oblivious interference scheduling (Q5170319) (← links)
- Oblivious Routing for the Lp-norm (Q5171160) (← links)
- Computing Cut-Based Hierarchical Decompositions in Almost Linear Time (Q5383976) (← links)
- Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods (Q5390612) (← links)
- Optimal online buffer scheduling for block devices (Q5415503) (← links)
- Almost tight bounds for reordering buffer management (Q5419131) (← links)
- (Q5743509) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)
- (Q5874505) (← links)
- Vertex Sparsifiers: New Results from Old Techniques (Q5891880) (← links)
- Algorithms - ESA 2003 (Q5897243) (← links)
- Optimal oblivious routing in polynomial time (Q5901088) (← links)
- Vertex Sparsifiers: New Results from Old Techniques (Q5901179) (← links)
- Optimal oblivious routing in polynomial time (Q5917575) (← links)