2446 search results - page 177 / 490 » Choiceless Polynomial Time |
109
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
125
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the c...
112
click to vote
BIRTHDAY
2009
Springer
15 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
144
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...
112
click to vote
LATA
2009
Springer
15 years 11 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...