986 search results - page 74 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
125
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
182
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
111
click to vote
SOFSEM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
153
Voted
WDAG
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
WAOA
2007
Springer
15 years 9 months ago
2007
Springer
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...