• Publications
  • Influence
Approximating minimum bounded degree spanning trees to within one of optimal
tl;dr
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
tl;dr
We give a (3/2-\eps_0)-approximation algorithm for the traveling salesman problem on graph metrics. Expand
  • 153
  • 17
Open Access
Survivable network design with degree or order constraints
tl;dr
We present algorithmic and hardness results for network design problems with degree or order constraints. Expand
  • 108
  • 15
Open Access
A geometric alternative to Nesterov's accelerated gradient descent
tl;dr
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
  • 110
  • 10
Open Access
The Price of Fair PCA: One Extra Dimension
tl;dr
We investigate whether the standard dimensionality reduction technique of PCA inadvertently produces data representations with different fidelity for two different populations. Expand
  • 38
  • 8
Open Access
Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
tl;dr
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
Open Access
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
Open Access
Approximating the k-multicut problem
tl;dr
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
  • 49
  • 6
Open Access
LP-Based Algorithms for Capacitated Facility Location
tl;dr
In this paper, we present a linear programming relaxation with constant integrality gap for capacitated facility location. Expand
  • 69
  • 5
Open Access
Entropy, optimization and counting
tl;dr
We study the problem of computing max-entropy distributions over a discrete set of objects subject to observed marginals. Expand
  • 50
  • 5
Open Access