scispace - formally typeset
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
Journal ArticleDOI

Modifying edges of a network to obtain short subgraphs

TL;DR: The first polynomial time approximation algorithms for the problem of developing a reduction strategy satisfying the budget constraint are presented, where the cost functions c e are allowed to be taken from a broad class of functions.
Book ChapterDOI

Topology Control Problems under Symmetric and Asymmetric Power Thresholds

TL;DR: This work considers topology control problems where the goal is to assign transmission powers to the nodes of an ad hoc network so as to induce graphs satisfying specific properties, and presents results under both symmetric and asymmetric power threshold models.
Book ChapterDOI

A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs

TL;DR: The authors' approximation schemes for hierarchically specified unit disk graphs along with the results in [MHSR94] are the first approximation schemes in the literature for natural PSPACE-hard optimization problems.
Book ChapterDOI

Formal Language Constrained Path Problems

TL;DR: Given an alphabet σ, a (directed) graph G whose edges are weighted and σ-labeled, and a formal language L \(\subseteq\) σ*, this work considers the problem of finding a shortest (simple) path p in G complying with the additional constraint that l(p) ∃ L.