✦ LIBER ✦

On complexity of a choice problem of the vector subset with the maximum sum length

✍ Scribed by A. V. Pyatkin

Book ID: 111471315
Publisher: Pleiades Publishing
Year: 2010
Tongue: English
Weight: 403 KB
Volume: 4
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478910040095

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The problem of finding a subset of vecto

The problem of finding a subset of vectors with the maximum total weight

✍ A. E. Baburin; E. Kh. Gimadi; N. I. Glebov; A. V. Pyatkin 📂 Article 📅 2008 🏛 Pleiades Publishing 🌐 English ⚖ 528 KB

On a version of the problem of choosing

On a version of the problem of choosing a vector subset

✍ A. V. Kel’manov; A. V. Pyatkin 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 528 KB

On two problems of choosing some subset

On two problems of choosing some subset of vectors with integer coordinates that has maximum norm of the sum of elements in Euclidean space

✍ E. Kh. Gimadi; Yu. V. Glazkov; I. A. Rykov 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 642 KB

The complexity of finding maximum disjoi

The complexity of finding maximum disjoint paths with length constraints

✍ A. Itai; Y. Perl; Y. Shiloach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

On the complexity of a search for a subs

On the complexity of a search for a subset of “similar” vectors

✍ A. V. Kel’manov; A. V. Pyatkin 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 142 KB

On the complexity of finding a local max

On the complexity of finding a local maximum of functions on discrete planar subsets

✍ Anton Mityagin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 237 KB

We study how many values of an unknown integer-valued function f one needs to know in order to ÿnd a local maximum of f. We consider functions deÿned on ÿnite subsets of discrete plane. We prove upper bounds for functions deÿned on rectangles and present lower bounds for functions deÿned on arbitrar