2423 search results - page 230 / 485 » AnswerArt - Contextualized Question Answering |
193
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
180
Voted
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The parallel repetition theorem states that for any two provers one round game with value at most 1 − (for < 1/2), the value of the game repeated n times in parallel is at mo...
167
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
157
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
168
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...