The following pages link to Adam Meyerson (Q222787):
Displaying 38 items.
- Bandwidth and low dimensional embedding (Q388456) (← links)
- A \(k\)-median algorithm with running time independent of data size (Q703077) (← links)
- Minimum failure explanations for path vector routing changes (Q857773) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- Fair welfare maximization (Q1031840) (← links)
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks (Q1662512) (← links)
- Simultaneous optimization via approximate majorization for concave profits or convex costs (Q2498404) (← links)
- Web caching using access statistics (Q2768320) (← links)
- Approximate majorization and fair online load balancing (Q2768323) (← links)
- Distributed admission control, scheduling, and routing with stale information (Q2768355) (← links)
- Improved algorithms for fault tolerant facility location (Q2768358) (← links)
- Online Multidimensional Load Balancing (Q2851864) (← links)
- Simultaneous source location (Q2930292) (← links)
- Approximate majorization and fair online load balancing (Q2944501) (← links)
- Bandwidth and Low Dimensional Embedding (Q3088081) (← links)
- Combining fairness with throughput (Q3192040) (← links)
- Cost-Distance: Two Metric Network Design (Q3395048) (← links)
- (Q3549706) (← links)
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows (Q3580966) (← links)
- Reducing truth-telling online mechanisms to online optimization (Q3581276) (← links)
- Randomized online algorithms for minimum metric bipartite matching (Q3581513) (← links)
- Embedding Bounded Bandwidth Graphs into ℓ1 (Q3613746) (← links)
- Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs (Q3638867) (← links)
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition (Q3638883) (← links)
- A Constant Factor Approximation for the Single Sink Edge Installation Problem (Q3654382) (← links)
- Representing graph metrics with fewest edges (Q4418664) (← links)
- A constant factor approximation algorithm for the fault-tolerant facility location problem (Q4458888) (← links)
- Local Search Heuristics for <i>k</i>-Median and Facility Location Problems (Q4651480) (← links)
- Local search heuristic for k-median and facility location problems (Q5175949) (← links)
- Profit-earning facility location (Q5175950) (← links)
- A constant factor approximation for the single sink edge installation problems (Q5175993) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313024) (← links)
- (Q5365019) (← links)
- Approximation Algorithms for Orienteering and Discounted-Reward TSP (Q5386217) (← links)
- (Q5413901) (← links)
- Coupled and k-Sided Placements: Generalizing Generalized Assignment (Q5419009) (← links)
- Frugal Routing on Wireless Ad-Hoc Networks (Q5459979) (← links)
- Combining fairness with throughput: Online routing with multiple objectives (Q5952452) (← links)
