3875 search results - page 192 / 775 » Approximation algorithms for the 0-extension problem |
170
Voted
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
154
Voted
ECRTS
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
158
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
133
Voted
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
165
click to vote
CSCLP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...