• Publications
  • Influence
Approximating minimum bounded degree spanning trees to within one of optimal
TLDR
In the <sc>Minimum Bounded Degree Spanning Tree</sc> problem, we aregiven an undirected graph with a degree upper bound B<sub>v</sub> on each vertex v, and the task is to find a spanning tree of minimumcost which satisfies all the degree bounds. Expand
  • 128
  • 26
A Randomized Rounding Approach to the Traveling Salesman Problem
TLDR
We give a (3/2-\eps_0)-approximation algorithm for the traveling salesman problem on graph metrics. Expand
  • 159
  • 17
  • PDF
Survivable network design with degree or order constraints
TLDR
We present algorithmic and hardness results for network design problems with degree or order constraints. Expand
  • 108
  • 15
  • PDF
A geometric alternative to Nesterov's accelerated gradient descent
TLDR
We propose a new method for unconstrained optimization of a smooth and strongly convex function, which attains the optimal rate of convergence of Nesterov’s accelerated gradient descent. Expand
  • 111
  • 10
  • PDF
The Price of Fair PCA: One Extra Dimension
TLDR
We investigate whether the standard dimensionality reduction technique of PCA inadvertently produces data representations with different fidelity for two different populations. Expand
  • 43
  • 9
  • PDF
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
TLDR
In metric asymmetric traveling salesperson problems the input is a complete directed graph in which edge weights satisfy the triangle inequality, and one is required to find a minimum weight walk that visits all vertices. Expand
  • 73
  • 7
  • PDF
Dynamic models for wind turbines and wind power plants
The primary objective of this report was to develop universal manufacturer-independent wind turbine and wind power plant models that can be shared, used, and improved without any restrictions byExpand
  • 135
  • 6
  • PDF
Approximating the k-multicut problem
TLDR
We study the <i>k</i>-multicut problem: Given an edge-weighted undirected graph, a set of pairs of vertices, and a target < i>k = l</i>, find the minimum cost set of edges whose removal disconnects at least k pairs. Expand
  • 50
  • 6
  • PDF
Secretary Problems via Linear Programming
TLDR
In the classical secretary problem an employer would like to choose the best candidate among n competing candidates that arrive in a random order. Expand
  • 40
  • 6
  • PDF
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
TLDR
We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in $d$ dimensions. Expand
  • 24
  • 6
  • PDF