Skip to main content
Conference Proceedings

The restricted word shadow problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7777 364-370
DOI: 10.1007/978-3-642-36899-8_16
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently we introduced and studied the shadow minimization problem under word-subword relation. In this paper we consider this problem for the restricted case and give optimal solution. © Springer-Verlag Berlin Heidelberg 2013.

Author supplied keywords

Cite

CITATION STYLE

APA

Ahlswede, R., & Lebedev, V. (2013). The restricted word shadow problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 364–370). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free