Sciweavers

48 search results - page 1 / 10
» The Minimum Number of Monotone Subsequences
Sort
View
JDA
2008
67views more  JDA 2008»
13 years 3 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
13 years 3 months ago
The Minimum Number of Monotone Subsequences
Erdos and Szekeres showed that any permutation of length n k2 + 1 contains
Joseph Samuel Myers
TCS
2010
12 years 10 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee
TCS
2008
13 years 3 months ago
Algorithms for subsequence combinatorics
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
Cees H. Elzinga, Sven Rahmann, Hui Wang
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
13 years 10 months ago
Untangled Monotonic Chains and Adaptive Range Search
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...