default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Discrete Algorithms, Volume 19
Volume 19, March 2013
- Laurent Bulteau, Guillaume Fertin
, Irena Rusu:
Maximal strip recovery problem with gaps: Hardness and approximation algorithms. 1-22 - Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Compressed text indexing with wildcards. 23-29 - Takuro Fukunaga:
Approximating minimum cost source location problems with local vertex-connectivity demands. 30-38 - Nedialko B. Dimitrov, C. Greg Plaxton:
Optimal cover time for a graph-based coupon collector process. 39-51
- Xiangzhi Wei, Ajay Joneja:
An improved algorithm for the shortest descending path on a convex terrain. 52-56
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-26 00:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
