You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures
Annotation Constituting the refereed proceedings of the 12th Algorithms and Data Structures Symposium held in New York in August 2011, this text presents original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry and databases.
This book constitutes the refereed conference proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, CP 2015, held in Cork, Ireland, in August/September 2015. This edition of the conference was part of George Boole 200, a celebration of the life and work of George Boole who was born in 1815 and worked at the University College of Cork. It was also co-located with the 31st International Conference on Logic Programming (ICLP 2015). The 48 revised papers presented together with 3 invited talks and 16 abstract papers were carefully selected from numerous submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, schedulling, configuration, and planning.
This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.
This book constitutes the thoroughly refereed post-conference proceedings of the 21st International Symposium on Graph Drawing, GD 2013, held in Bordeaux, France, in September 2013. The 42 revised full papers presented together with 12 revised short papers, 3 invited talks and 1 poster description were carefully reviewed and selected from 110 submissions. The papers are organized in topical sections on upward drawings, planarity, beyond planarity, geometric representations, 3D et al., universality, practical graph drawing, subgraphs, crossings, geometric graphs and geographic networks, angular restrictions, grids, curves and routes. The book also contains a short description of the graph drawing contest.
Given points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.
Nacht- und Schichtarbeit gibt es schon seit jeher. Früher waren Berufe wie die des Nachtwärters oder Arztes als Beispiele zu nennen. Im Industriezeitalter stehen eine hohe Kapazitätsauslastung von Maschinen sowie hohe Produktivität im Unternehmen im Vordergrund. Um dies zu erreichen, erscheint die Nacht- und Schichtarbeit als ein geeignetes Mittel. Doch neben den wirtschaftlichen Nutzen, die die Nacht- und Schichtarbeit mit sich bringt, gibt es auch Schattenseiten. Sie führt zu gesundheitlichen und sozialen Problemen bei den Nacht- und Schichtarbeitern, was für Diskussionsstoff sorgt. Schließlich arbeiten 10 – 20 % aller Erwerbstätigen als Nacht- und/oder Schichtarbeiter. Und genau...
In Zeiten stetig wachsender Anforderungen an die Mitarbeiter steigt die Bedeutung der Gesundheit und Gesunderhaltung am Arbeitsplatz. Führungskräfte haben sich nicht nur im Rahmen Ihrer Sorgfaltspflicht der Aufgabe zu stellen, dazu beizutragen. Aber welche Bestimmungsstücke begünstigen, dass Führungskräfte als Verantwortungsträger in Unternehmen ihrer speziellen Verantwortung für die Gesundheit ihrer Mitarbeiter nachkommen und diese gesundheitsförderlich führen? Gesundheitsförderliches Führen als eine spezifische gesundheitsförderliche Interaktion mit den Mitarbeitern, gesundheitsförderliche Gestaltung von Arbeitstätigkeiten sowie Unterstützung und Realisierung von betrieblic...