986 search results - page 115 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
123
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
151
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
150
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
146
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
113
Voted
DAGSTUHL
2007
15 years 5 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...