17 search results - page 2 / 4 » tamc 2009 |
TAMC
2009
Springer
2009
Springer
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
13 years 12 months ago
We consider the feedback vertex set and feedback arc set problems in bipartite tournaments. We improve on recent results by giving a 2-approximation algorithm for the feedback vert...
TAMC
2009
Springer
13 years 12 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
TAMC
2009
Springer
13 years 12 months ago
2009
Springer
We show that logical and behavioral equivalence for stochastic Kripke models over general measurable spaces are the same. Usually, this requires some topological assumptions and in...
TAMC
2009
Springer
13 years 12 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
TAMC
2009
Springer
13 years 12 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...