986 search results - page 79 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
148
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
103
Voted
COCOON
1998
Springer
15 years 7 months ago
1998
Springer
In this paper, we generalize the Ski-Rental Problem to the Bahncard Problem which is an online problem of practical relevance for all travelers. The Bahncard is a railway pass of t...
154
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
141
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
118
Voted
JSAC
2006
15 years 3 months ago
2006
This paper addresses the problem of routing and wavelength assignment (RWA) of scheduled lightpath demands (SLDs) in wavelength routed optical networks with no wavelength converter...