2 citations · 5 across the 5 of their papers we have counts for
3 papers · 1 filter
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms
Chandra Chekuri, Manuel R. Torres
Dense subgraph discovery is an important problem in graph mining and network analysis with several applications. Two canonical problems here are to find a maxcore (subgraph of maxi…
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems
Chandra Chekuri, Kent Quanrud, Manuel R. Torres
We develop fast approximation algorithms for the minimum-cost version of the Bounded-Degree MST problem (BD-MST) and its generalization the Crossing Spanning Tree problem (Crossing…
A Topological Algorithm for Determining How Road Networks Evolve Over Time
M T Goodrich, Siddharth Gupta, Manuel R. Torres
We provide an efficient algorithm for determining how a road network has evolved over time, given two snapshot instances from different dates. To allow for such determinations acro…