M
Madhav V. Marathe
Researcher at University of Virginia
Publications - 356
Citations - 15017
Madhav V. Marathe is an academic researcher from University of Virginia. The author has contributed to research in topics: Approximation algorithm & Computer science. The author has an hindex of 53, co-authored 315 publications receiving 13493 citations. Previous affiliations of Madhav V. Marathe include University at Albany, SUNY & Los Alamos National Laboratory.
Papers
More filters
Proceedings Article
Routing in time-dependent and labeled networks
TL;DR: The main focus is a unified algorithm that efficiently solves a number of seemingly unrelated problems in transportation science and proposes monotonic piecewise-linear traversal functions to represent the time-dependent aspect of link delays.
Journal ArticleDOI
Symmetry Properties of Nested Canalyzing Functions
TL;DR: It is shown that for any NCF f, the notion of strong asymmetry considered in the literature is equivalent to the property that f is $n$-symmetric, and a closed form expression is derived for the number of Boolean functions that are NCFs and strongly asymmetric.
Book ChapterDOI
Budget Constrained Minimum Cost Connected Medians
TL;DR: Lower bounds on the approximability of the problem are proved that demonstrate that the performance ratios are close to best possible, and bicriteria approximation algorithms are presented.
Posted Content
Wisdom of the Ensemble: Improving Consistency of Deep Learning Models
Lijing Wang,Dipanjan Ghosh,Maria Teresa Gonzalez Diaz,Ahmed K. Farahat,Mahbubul Alam,Chetan Gupta,Jiangzhuo Chen,Madhav V. Marathe +7 more
TL;DR: It is proved that consistency and correct-consistency of an ensemble learner is not less than the average consistency andCorrect-consistsency of individual learners and corrects can be improved with a probability by combining learners with accuracy not lessthan the average accuracy of ensemble component learners.
Posted Content
The Complexity of Planar Counting Problems
TL;DR: It is proved that there are no $\epsilon$-approximation algorithms for the problems of maximizing or minimizing a linear objective function subject to a planar system of linear inequality constraints over the integers.