367 search results - page 2 / 74 » Tight lower bounds for the online labeling problem |
ICALP
2009
Springer
14 years 8 days ago
2009
Springer
WDAG
2009
Springer
14 years 2 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 ...
COCO
2004
Springer
13 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...
APPROX
2006
Springer
13 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...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE