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

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

We investigate whether the standard dimensionality reduction technique of PCA inadvertently produces data representations with different fidelity for two different populations.Expand

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

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 by… Expand

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

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

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