V
Venkatesh Radhakrishnan
Researcher at University at Albany, SUNY
Publications - 8
Citations - 387
Venkatesh Radhakrishnan is an academic researcher from University at Albany, SUNY. The author has contributed to research in topics: Time complexity & Graph (abstract data type). The author has an hindex of 5, co-authored 8 publications receiving 373 citations. Previous affiliations of Venkatesh Radhakrishnan include State University of New York System.
Papers
More filters
Journal ArticleDOI
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
Harry B. Hunt,Madhav V. Marathe,Venkatesh Radhakrishnan,S. S. Ravi,Daniel J. Rosenkrantz,Richard Edwin Stearns +5 more
TL;DR: The approximation schemes for hierarchically specified unit disk graphs presented in this paper are among the first approximation schemes in the literature for natural PSPACE-hard optimization problems.
Book ChapterDOI
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems
TL;DR: Efficient algorithms are presented for solving systems of linear equations defined on and for solving path problems for treewidth k graphs and for α-near-planar graphs.
Proceedings Article
Complexity of hierarchically and 1-dimensional periodically specified problems
TL;DR: In this paper, the complexity of various combinatorial and satisfiability problems when instances are specified using one of the following specifications: (1) the 1-dimensional finite periodic narrow specifications of Wanke and Ford et al. (2) the 2-way infinite1-dimensional narrow periodic specifications of Orlin et al., (3) the hierarchical specifications of Lengauer et al, and (4) the 3-dimensional CNF satisfiability problem of Schaefer.
Book ChapterDOI
Compact Location Problems
TL;DR: This formulation models a number of problems arising in facility location, statistical clustering, pattern recognition, and also a processor allocation problem in multiprocessor systems.
Book ChapterDOI
Hierarchical Specified Unit Disk Graphs (Extended Abstract)
TL;DR: Both PSPACE-hardness results and polynomial time approximations are presented for most of the problems considered, including minimum vertex coloring, maximum independent set, minimum clique cover, minimum dominating set and minimum independent dominating set.