The following pages link to Heiko Röglin (Q340548):
Displayed 50 items.
- Polynomial kernels for weighted problems (Q340549) (← links)
- A bad instance for \texttt{k-means++} (Q393129) (← links)
- Smoothed performance guarantees for local search (Q403643) (← links)
- Competitive routing over time (Q719282) (← links)
- Smoothed analysis of integer programming (Q877191) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- New deterministic algorithms for solving parity games (Q1756345) (← links)
- Probabilistic analysis of online (class-constrained) bin packing and bin covering (Q2294707) (← links)
- Internet routing between autonomous systems: fast algorithms for path trading (Q2341707) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- Improved analysis of complete-linkage clustering (Q2408165) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering (Q2802961) (← links)
- Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching (Q2865023) (← links)
- Computing approximate Nash equilibria in network congestion games (Q2913950) (← links)
- (Q2934725) (← links)
- Economical Caching (Q2947577) (← links)
- (Q2954993) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- Worst-case and smoothed analysis of k-means clustering with Bregman divergences (Q2968098) (← links)
- The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
- Uncoordinated Two-Sided Matching Markets (Q2999856) (← links)
- A Bad Instance for k-Means++ (Q3010415) (← links)
- Lower Bounds for the Smoothed Number of Pareto Optimal Solutions (Q3010422) (← links)
- The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers (Q3075448) (← links)
- Smoothed Performance Guarantees for Local Search (Q3092279) (← links)
- (Q3191602) (← links)
- On the impact of combinatorial structure on congestion games (Q3452191) (← links)
- Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem (Q3452814) (← links)
- Improved Analysis of Complete-Linkage Clustering (Q3452828) (← links)
- Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games (Q3511400) (← links)
- A Unified Approach to Congestion Games and Two-Sided Markets (Q3574305) (← links)
- Smoothed Analysis of Integer Programming (Q3596340) (← links)
- Agnostic Clustering (Q3648765) (← links)
- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences (Q3652289) (← links)
- The Alternating Stock Size Problem and the Gasoline Puzzle (Q4554346) (← links)
- (Q4606344) (← links)
- (Q4633855) (← links)
- Smoothed Analysis of Belief Propagation for Minimum-Cost Flow and Matching (Q4914447) (← links)
- Smoothed Analysis of the 2-Opt Algorithm for the General TSP (Q4962645) (← links)
- Smoothed Analysis of Local Search for the Maximum-Cut Problem (Q4962657) (← links)
- Smoothed Analysis of Pareto Curves in Multiobjective Optimization (Q5027281) (← links)
- k-Means Has Polynomial Smoothed Complexity (Q5171190) (← links)
- Smoothed Analysis of Multiobjective Optimization (Q5171226) (← links)
- Analysis of Ward's Method (Q5236375) (← links)
- Evaluation of Online Strategies for Reordering Buffers (Q5307543) (← links)
- Finding Short Paths on Polytopes by the Shadow Vertex Algorithm (Q5326568) (← links)
- Smoothed Analysis of Local Search for the Maximum-Cut Problem (Q5384027) (← links)
- (Q5389993) (← links)