986 search results - page 117 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
131
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
130
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
160
click to vote
SODA
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
134
click to vote
ALENEX
2009
15 years 1 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
145
Voted
ICCAD
2010
IEEE
15 years 1 months ago
2010
IEEE
Global Routing has been a traditional EDA problem. It has congestion elimination as the first and foremost priority. Despite of the recent development for popular rip-up and rerout...