Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings de Rolf Karlsson

Algorithm Theory - SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, July 1996. Proceedings: Lecture Notes in Computer Science, cartea 1097

Editat de Rolf Karlsson, Andrzej Lingas
en Limba Engleză Paperback – 19 iun 1996
This book constitutes the refereed proceedings of the Fifth Scandinavian Workshop on Algorithm Theory, SWAT '96, held in Reykjavik, Iceland, in July 1996.
The 35 full papers included in the book in revised version were carefully selected from a total of 95 submissions; also included are abstracts or full versions of three invited talks by prominent researchers. All in all, the collection of articles reports state-of-the-art results on various topics of current design and analysis of algorithms.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33527 lei

Preț vechi: 41908 lei
-20% Nou

Puncte Express: 503
Preț estimativ în valută:
6416€ • 6684$ • 5335£

Carte tipărită la comandă

Livrare economică 11-25 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540614227
ISBN-10: 3540614222
Pagini: 472
Ilustrații: X, 462 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.65 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Derandomization via small sample spaces.- The randomized complexity of maintaining the minimum.- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning.- Service-constrained network design problems.- Approximate hypergraph coloring.- Facility dispersion and remote subgraphs.- The constrained minimum spanning tree problem.- Randomized approximation of the constraint satisfaction problem.- On the hardness of global and local approximation.- Approximation algorithms for the maximum satisfiability problem.- On the hardness of approximating the minimum consistent OBDD problem.- Computing the unrooted maximum agreement subtree in sub-quadratic time.- Greedily finding a dense subgraph.- Using sparsification for parametric minimum spanning tree problems.- Vertex partitioning problems on partial k-trees.- Making an arbitrary filled graph minimal by removing fill edges.- Sorting and searching revisted.- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching.- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees.- Neighborhood graphs and distributed ?+1-coloring.- Communication complexity of gossiping by packets.- Optimal cost-sensitive distributed minimum spanning tree algorithm.- A linear time algorithm for the feasibility of pebble motion on trees.- Linear-time heuristics for minimum weight rectangulation.- Visibility with multiple reflections.- A fast heuristic for approximating the minimum weight triangulation.- Neighbours on a grid.- On two dimensional packing.- Optimal orthogonal drawings of triconnected plane graphs.- Walking streets faster.- Safe and efficient traffic laws for mobile robots.- Progress in selection.- Probabilistic ancestral sequences and multiplealignments.- Efficient algorithms for Lempel-Ziv encoding.- The deterministic complexity of parallel multisearch.- Priority queues on parallel machines.- Binary search trees: How low can you go?.- Boolean analysis of incomplete examples.