851 search results - page 7 / 171 » An exact algorithm for solving the vertex separator problem |
127
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
133
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
134
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
167
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
135
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...