Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Venkatesh Raman:

TR02-031 | 30th April 2002
Vikraman Arvind, Venkatesh Raman

Approximate Counting small subgraphs of bounded treewidth and related problems

Revisions: 1

We give a randomized approximation algorithm taking
$O(k^{O(k)}n^{b+O(1)})$ time to count the number of copies of a
$k$-vertex graph with treewidth at most $b$ in an $n$ vertex graph
$G$ with approximation ratio $1/k^{O(k)}$ and error probability
inverse exponential in $n$. This algorithm is based on ... more >>>

TR97-033 | 1st August 1997
Meena Mahajan, Venkatesh Raman

Parametrizing Above Guaranteed Values: MaxSat and MaxCut

In this paper we investigate the parametrized
complexity of the problems MaxSat and MaxCut using the
framework developed by Downey and Fellows.

Let $G$ be an arbitrary graph having $n$ vertices and $m$
edges, and let $f$ be an arbitrary CNF formula with $m$
clauses on $n$ variables. We improve ... more >>>

ISSN 1433-8092 | Imprint