Logan Smith

Applied Scientist at Amazon.com interested in discrete, linear, mixed integer, distributed, and stochastic optimization problems where ever they arise.

Partitioning a graph into low-diameter clusters

  • Jack Zhang
  • Lucas Vinícius Silveira de Lima
  • Hamidreza Validi
  • Logan Smith
  • Austin Buchanan
  • Illya V. Hicks
    • Categories Branch and Cut Algorithms, Combinatorial Optimization, Network Optimization Tags , , , ,

    This paper studies the problems of partitioning the vertices of a graph G = (V,E) into (or covering with) a minimum number of low-diameter clusters from the lenses of approximation algorithms and integer programming. Here, the low-diameter criterion is formalized by an s-club, which is a subset of vertices whose induced subgraph has diameter at … Read more