5 research outputs found
Relations between automata and the simple k-path problem
Let be a directed graph on vertices. Given an integer , the
SIMPLE -PATH problem asks whether there exists a simple -path in . In
case is weighted, the MIN-WT SIMPLE -PATH problem asks for a simple
-path in of minimal weight. The fastest currently known deterministic
algorithm for MIN-WT SIMPLE -PATH by Fomin, Lokshtanov and Saurabh runs in
time for graphs with integer weights in
the range . This is also the best currently known deterministic
algorithm for SIMPLE k-PATH- where the running time is the same without the
factor. We define to be the set of words of
length whose symbols are all distinct. We show that an explicit
construction of a non-deterministic automaton (NFA) of size for implies an algorithm of running time for MIN-WT SIMPLE -PATH when the weights are
non-negative or the constructed NFA is acyclic as a directed graph. We show
that the algorithm of Kneis et al. and its derandomization by Chen et al. for
SIMPLE -PATH can be used to construct an acylic NFA for of size
.
We show, on the other hand, that any NFA for must be size at least
. We thus propose closing this gap and determining the smallest NFA for
as an interesting open problem that might lead to faster algorithms
for MIN-WT SIMPLE -PATH.
We use a relation between SIMPLE -PATH and non-deterministic xor automata
(NXA) to give another direction for a deterministic algorithm with running time
for SIMPLE -PATH
Finding the Minimum-Weight k-Path
Given a weighted -vertex graph with integer edge-weights taken from a
range , we show that the minimum-weight simple path visiting
vertices can be found in time \tilde{O}(2^k \poly(k) M n^\omega) = O^*(2^k
M). If the weights are reals in , we provide a
-approximation which has a running time of \tilde{O}(2^k
\poly(k) n^\omega(\log\log M + 1/\varepsilon)). For the more general problem
of -tree, in which we wish to find a minimum-weight copy of a -node tree
in a given weighted graph , under the same restrictions on edge weights
respectively, we give an exact solution of running time \tilde{O}(2^k \poly(k)
M n^3) and a -approximate solution of running time
\tilde{O}(2^k \poly(k) n^3(\log\log M + 1/\varepsilon)). All of the above
algorithms are randomized with a polynomially-small error probability.Comment: To appear at WADS 201
Monomial Testing and Applications
In this paper, we devise two algorithms for the problem of testing
-monomials of degree in any multivariate polynomial represented by a
circuit, regardless of the primality of . One is an time
randomized algorithm. The other is an time deterministic
algorithm for the same -monomial testing problem but requiring the
polynomials to be represented by tree-like circuits. Several applications of
-monomial testing are also given, including a deterministic
upper bound for the -set -packing problem.Comment: 17 pages, 4 figures, submitted FAW-AAIM 2013. arXiv admin note:
substantial text overlap with arXiv:1302.5898; and text overlap with
arXiv:1007.2675, arXiv:1007.2678, arXiv:1007.2673 by other author
On -Simple -Path
An -simple -path is a {path} in the graph of length that passes
through each vertex at most times. The -SIMPLE -PATH problem, given a
graph as input, asks whether there exists an -simple -path in . We
first show that this problem is NP-Complete. We then show that there is a graph
that contains an -simple -path and no simple path of length greater
than . So this, in a sense, motivates this problem especially
when one's goal is to find a short path that visits many vertices in the graph
while bounding the number of visits at each vertex.
We then give a randomized algorithm that runs in time that solves the -SIMPLE -PATH on a graph with
vertices with one-sided error. We also show that a randomized algorithm
with running time with gives a
randomized algorithm with running time \poly(n)\cdot 2^{cn} for the
Hamiltonian path problem in a directed graph - an outstanding open problem. So
in a sense our algorithm is optimal up to an factor