441 search results - page 4 / 89 » Optimal Subsequence Bijection |
COMBINATORICS
2004
13 years 6 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
STOC
2002
ACM
14 years 6 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
WWW
2009
ACM
14 years 7 months ago
2009
ACM
Much of the information on the Web is found in articles from online news outlets, magazines, encyclopedias, review collections, and other sources. However, extracting this content...
CCCG
2010
13 years 7 months ago
2010
Extending a bijection recently introduced by Poulalhon and Schaeffer [15] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulatio...
DM
1998
13 years 6 months ago
1998
One class of Davenport-Schinzel sequences consists of finite sequences over n symbols without immediate repetitions and without any subsequence of the type abab. We present a bij...