The following pages link to Avrim Blum (Q1127356):
Displaying 50 items.
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows (Q3580966) (← links)
- (Q4010315) (← links)
- On Learning Read-k-Satisfy-j DNF (Q4210120) (← links)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
- (Q4228499) (← links)
- A Constant-Factor Approximation Algorithm for the Geometric<i>k</i>-MST Problem in the Plane (Q4229405) (← links)
- (Q4230341) (← links)
- (Q4234074) (← links)
- (Q4234076) (← links)
- New approximation algorithms for graph coloring (Q4305670) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- Navigating in Unfamiliar Geometric Terrain (Q4337436) (← links)
- (Q4341754) (← links)
- An Online Algorithm for Improving Performance in Navigation (Q4507331) (← links)
- (Q4527040) (← links)
- Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems (Q4542526) (← links)
- Sparse Approximation via Generating Point Sets (Q4575617) (← links)
- Opting Into Optimal Matchings (Q4575903) (← links)
- (Q4608043) (← links)
- (Q4633885) (← links)
- (Q4633921) (← links)
- (Q4645648) (← links)
- Admission Control to Minimize Rejections (Q4665446) (← links)
- Learning Theory (Q4680919) (← links)
- (Q4778551) (← links)
- (Q4828909) (← links)
- (Q4829029) (← links)
- (Q4829037) (← links)
- (Q4839059) (← links)
- Coloring Random and Semi-Random k-Colorable Graphs (Q4845849) (← links)
- (Q4873672) (← links)
- (Q4875171) (← links)
- Sparse Approximation via Generating Point Sets (Q4972677) (← links)
- On Price versus Quality (Q4993279) (← links)
- Approximate Convex Hull of Data Streams (Q5002691) (← links)
- Approximation Stability and Proxy Objectives (Q5027272) (← links)
- (Q5075740) (← links)
- Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries (Q5130481) (← links)
- (Q5149007) (← links)
- Routing without regret (Q5177263) (← links)
- Foundations of Data Science (Q5215510) (← links)
- (Q5302085) (← links)
- (Q5302092) (← links)
- Learning Theory and Kernel Machines (Q5305838) (← links)
- Learning Theory and Kernel Machines (Q5305862) (← links)
- Approximation Algorithms for Orienteering and Discounted-Reward TSP (Q5386217) (← links)
- Separating Populations with Wide Data: A Spectral Analysis (Q5387777) (← links)
- Clustering under approximation stability (Q5395707) (← links)
- A learning theory approach to noninteractive database privacy (Q5395711) (← links)
- Open Problems in Efficient Semi-supervised PAC Learning (Q5434080) (← links)
