Atjaunināt sīkdatņu piekrišanu

E-grāmata: Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings

Edited by , Edited by
Citas grāmatas par šo tēmu:
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.
Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. ProceedingsPalielināt
Citas grāmatas par šo tēmu:

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015.

The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
Communication, Dynamics, and Renormalization
1(32)
Bernard Chazelle
"Green" Barrier Coverage with Mobile Sensors
33(14)
Amotz Bar-Noy
Dror Rawitz
Peter Terlecky
A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
47(14)
Cristina Bazgan
Andre Nichterlein
Rolf Niedermeier
Orthogonal Graph Drawing with Inflexible Edges
61(13)
Thomas Blasius
Sebastian Lehmann
Ignaz Rutter
Linear time Constructions of some d-Restriction Problems
74(15)
Nader H. Bshouty
Efficiently Testing T-Interval Connectivity in Dynamic Graphs
89(12)
Arnaud Casteigts
Ralf Klasing
Yessin M. Neggaz
Joseph G. Peters
Competitive Strategies for Online Clique Clustering
101(13)
Marek Chrobak
Christoph Durr
Bengt J. Nilsson
Scheduling with Gaps: New Models and Algorithms
114(13)
Marek Chrobak
Mordecai Golin
Tak-Wah Lam
Dorian Nogneng
MinMax-Distance Gathering on Given Meeting Points
127(13)
Serafino Cicerone
Gabriele Di Stefano
Alfredo Navarra
Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
140(13)
J. Czyzowicz
K. Georgiou
E. Kranakis
L. Narayanan
J. Opatrny
B. Vogtenhuber
Planarity of Streamed Graphs
153(14)
Giordano Da Lozzo
Ignaz Rutter
Clique-width of Graph Classes Defined by Two Forbidden Induced Subgraphs
167(15)
Konrad K. Dabrowski
Daniel Paulusma
Randomized Adaptive Test Cover
182(12)
Peter Damaschke
Contraction Blockers for Graphs with Forbidden Induced Paths
194(14)
Oznur Yasar Diner
Daniel Paulusma
Christophe Picouleau
Bernard Ries
On the Complexity of Wafer-to-Wafer Integration
208(13)
Guillerme Duvillie
Marin Bougeret
Vincent Boudet
Trivikram Dokka
Rodolphe Giroudeau
Label Placement in Road Maps
221(14)
Andreas Gemsa
Benjamin Niedermann
Martin Nollenburg
Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline
235(14)
Lisa Hellerstein
Devorah Kletenik
Patrick Lin
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
249(12)
Vikram Kamat
Neeldhara Misra
Simple Strategies Versus Optimal Schedules in Multi-agent Patrolling
261(13)
Akitoshi Kawamura
Makoto Soejima
Sharing Non-Anonymous Costs of Multiple Resources Optimally
274(14)
Max Klimm
Daniel Schmand
Algorithms Solving the Matching Cut Problem
288(12)
Dieter Kratsch
Van Bang Le
End-Vertices of Graph Search Algorithms
300(13)
Dieter Kratsch
Mathieu Liedloff
Daniel Meister
Deciding the On-line Chromatic Number of a Graph with Pre-Coloring Is PSPACE-Complete
313(12)
Christian Kudahl
A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices
325(14)
Monique Laurent
Matteo Seminaroti
Mixed Map Labeling
339(13)
Maarten Loffler
Martin Nollenburg
Frank Staals
Optimal Online Edge Coloring of Planar Graphs with Advice
352(13)
Jesper W. Mikkelsen
Approximability of Two Variants of Multiple Knapsack Problems
365(12)
Shuichi Miyazaki
Naoyuki Morimoto
Yasuo Okabe
Block Sorting is APX-Hard
377(13)
N.S. Narayanaswamy
Swapnoneel Roy
An Opportunistic Text Indexing Structure Based on Run Length Encoding
390(13)
Yuya Tamakoshi
Keisuke Goto
Shunsuke Inenaga
Hideo Bannai
Masayuki Takeda
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons
403(13)
Tom C. van der Zanden
Hans L. Bodlaender
Advice Complexity of Fine-Grained Job Shop Scheduling
416(13)
David Wehner
Author Index 429
Biežāk uzdotie jautājumi par e-grāmatām Biežāk uzdotie jautājumi par e-grāmatām
Permanent link: https://www.kriso.lv/db/97833191817382e.html
Keywords: