3 citations · 7 across the 6 of their papers we have counts for
6 papers
A Transformation--Based Approach for the Design of Parallel/Distributed Scientific Software: the FFT
Harry B. Hunt, Lenore R. Mullin, Daniel J. Rosenkrantz +1
We describe a methodology for designing efficient parallel and distributed scientific software. This methodology utilizes sequences of mechanizable algebra--based optimizing transf…
Bicriteria Network Design Problems
Madhav V. Marathe, R. Ravi, Ravi Sundaram +3
We study a general class of bicriteria network design problems. A generic problem in this class is as follows: Given an undirected graph and two minimization objectives (under diff…
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
Madhav V. Marathe, Harry B. Hunt, Richard E. Stearns +1
We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \cite{Le89} or are specified by 1-dimen…
The Complexity of Planar Counting Problems
Harry B. Hunt, Madhav V. Marathe, Venkatesh Radhakrishnan +1
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems incl…
Geometry based heuristics for unit disk graphs
Madhav V. Marathe, H. Breu, Harry B. Hunt +2
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization probl…
The complexity of approximating PSPACE-Complete problems for hierarchical specifications
Madhav V. Marathe, Harry B. Hunt, S. S. Ravi
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specified graphs, many of which are PSPACE-complete. Assuming P != PSPACE,…