Cantitate/Preț
Produs
Total produse
Vezi coșul
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings de Michael Fellows

Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Third Joint International Conference, FAW-AAIM 2013, Dalian,China, June 26-28, 2013, Proceedings: Lecture Notes in Computer Science, cartea 7924

Editat de Michael Fellows, Xuehou Tan, Binhai Zhu
en Limba Engleză Paperback – 6 iun 2013
This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
 The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33071 lei

Preț vechi: 41339 lei
-20% Nou

Puncte Express: 496
Preț estimativ în valută:
6329€ • 6594$ • 5262£

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: 9783642387555
ISBN-10: 3642387551
Pagini: 376
Ilustrații: XII, 364 p. 97 illus.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

The Square Root Phenomenon in Planar Graphs.- An Algorithm for Determining Whether a Pair of Polygons Is Reversible.- Disjoint Small Cycles in Graphs and Bipartite Graphs.- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree.- Algorithms for Testing Length Four Permutations.- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds.- Faster Exact Computation of rSPR Distance.- Arbitrated Quantum Signature Schemes: Attacks and Security.- Randomized Algorithms for Removable Online Knapsack Problems.- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs.- FWLS: A Local Search for Graph Coloring.- A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.- Monomial Testing and Applications.- The Optimal Rescue Path Set Problem in Undirected Graphs.- Expected Computations on Color Spanning Sets.- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs.- Spanning Distribution Trees of Graphs.- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem.- Zero-Visibility Cops and Robber Game on a Graph.- On (k,l)-Graph Sandwich Problems.- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints.- Two-Round Discrete Voronoi Game along a Line.- Inverse Maximum Flow Problems under the Combining Norms.- The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs.- A Cost-Efficient Scheduling Algorithm for TrafficGrooming.- Strategies of Groups Evacuation from a Convex Region in the Plane.- Kernelization and Lower Bounds of the Signed Domination Problem.- On Edge-Independent Sets.- On the Complexity of Approximate Sum of Sorted List.- Large Hypertree Width for Sparse Random Hypergraphs.- On Perfect Absorbants in De Bruijn Digraphs.- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width.- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints.- Zero-Sum Flow Numbers of Hexagonal Grids.- Pattern-Guided k-Anonymity.

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 7th International Frontiers of Algorithmics Workshop, FAW 2013, and the 9th International Conference on Algorithmic Aspects in Information and Management, AAIM 2013, jointly held in Dalian, China, in June 2013.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The Joint Conference provide a focused forum on current trends of research on algorithms, discrete structures, operation research, combinatorial optimization and their applications, and will bring together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The mission of the Joint Conference is to stimulate the various fields for which algorithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western research communities of algorithmics and applications.

Caracteristici

Fast track conference proceedings Unique visibility State of the art research