367 search results - page 2 / 74 » Tight lower bounds for the online labeling problem |
150
click to vote
WDAG
2009
Springer
16 years 19 days ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
173
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
174
click to vote
APPROX
2006
Springer
15 years 9 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...