Evangelos Kranakis; Gonzalo Navarro; Edgar Ch?vez LATIN 2016: Theoretical Informatics 9783662495285

Варианты приобретения

Цена: 12298.00р.
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: Есть
При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Evangelos Kranakis; Gonzalo Navarro; Edgar Ch?vez
Название: LATIN 2016: Theoretical Informatics
ISBN: 9783662495285
Издательство: Springer
Классификация:

Дискретная математика

Алгоритмы и структуры данных

Разработка и эксплуатационная простота пользовательского интерфейса

ISBN-10: 3662495287
Обложка/Формат: Paperback
Страницы: 714
Вес: 1.02 кг.
Дата издания: 23.03.2016
Серия: Theoretical Computer Science and General Issues
Язык: English
Размер: 234 x 156 x 38
Основная тема: Computer Science
Подзаголовок: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание:

Reversible Figures and Solids.- Simplicity is in Vogue (again).- Subgame Perfect Equilibrium: Computation and Efficiency.- Buying Stuff Online.- Data Crowdsourcing: Is It for Real.- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion.- A Middle Curve Based on Discrete Frйchet Distance.- Comparison-Based FIFO Buffer Management in QoS Switches.- Scheduling on Power-Heterogeneous Processors.- Period Recovery over the Hamming and Edit Distances.- Chasing Convex Bodies and Functions.- Parameterized Lower Bounds and Dichotomy Results for the NP-Completeness of H-Free Edge Modification Problems.- Parameterized Complexity of Red Blue Set Cover for lines.- Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons.- On Mobile Agent Verifiable Problems.- Computing Maximal Layers Of Points In E^f⁽ⁿ⁾ .- On the Total Number of Bends for Planar Octilinear Drawings.- Bidirectional BWT-Based De Bruijn Graphs.- The Read/Write Protocol Complex is Collapsible.- The I/O Complexity of Computing Prime Tables.-Increasing Diamonds.- Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.- A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-Vertex Cover in Bipartite Graphs.- Improved Spanning Ratio for Low Degree Spanners.- Constructing Consistent Digital Line Segments.- Faster Information Gathering in Ad-Hoc Radio Tree Networks.- Stabbing circles for Sets of Segments in the Plane.- Faster Algorithms to Enumerate Hypergraph Transversals.- Listing Acyclic Orientations of Graphs with Single and Multiple Sources.- Linear-Time Sequence Comparison Using Minimal Absent Words.- The Grandmama de Bruijn Sequence for Binary Strings.- Compressing Bounded Degree Graphs.- Random Partial Match Queries in Quad-K-d Trees.- From Discrepancy to Majority.- On the Planar Split Thickness of Graphs.- A Bounded-Risk Mechanism for the Kidney Exchange Game.- Tight Approximations of Degeneracy in Large Graphs.- Improved Approximation Algorithms for Capacitated Fault-Tolerant k-Center.- Bundled Crossings in Embedded Graphs.- Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering.- Deterministic Sparse Suffix Sorting on Rewritable Texts.- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Ordering.- Unshuffling Permutations.- Generating Random Spanning Trees via Fast Matrix Multiplication.- Routing in Unit Disk Graphs.- Graph Drawings with One Bend and Few Slopes.- Edge-Editing to a Dense and a Sparse Graph Class.- Containment and Evasion in Stochastic Point Data.- Tree Compression Using String Grammars.- Trees and Languages with Periodic Signature.- Rank Reduction of Directed Graphs by Vertex and Edge Deletions.- New Deterministic Algorithms for Solving Parity Games.- Computing a Geodesic Two-Center of Points in a Simple Polygon.- Simple Approximation Algorithms for Balanced MAX 2SAT.- A Parameterized Algorithm for Mixed-Cut.- (k; n - k)-MAX-CUT: An O*(2^p)-Time Algorithm and a Polynomial Kernel.- Independent set of convex polygons: from n^Ɛ to 1 + Ɛ via shrinking.

LATIN 2016: Theoretical Informatics, Evangelos Kranakis; Gonzalo Navarro; Edgar Ch?vez