3 papers
math.OC2021
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
Naga V. C. Gudapati, Enrico Malaguti, Michele Monaci
Network design, a cornerstone of mathematical optimization, is about defining the main characteristics of a network satisfying requirements on connectivity, capacity, and level-of-…
cs.DS2019
In Search of Dense Subgraphs: How Good is Greedy Peeling?
Naga V. C. Gudapati, Enrico Malaguti, Michele Monaci
The problem of finding the densest subgraph in a given graph has several applications in graph mining, particularly in areas like social network analysis, protein and gene analyses…
math.OC2017
Fast and Safe: Accelerated gradient methods with optimality certificates and underestimate sequences
Majid Jahani, Naga Venkata C. Gudapati, Chenxin Ma +2
In this work we introduce the concept of an Underestimate Sequence (UES), which is motivated by Nesterov's estimate sequence. Our definition of a UES utilizes three sequences, one…