Algorithms and Data Structures

4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings

By: Selim G. Akl (Editor), Frank Dehne (Editor), JÃ¶rg-RÃ¼diger Sack (Editor)

Write A Review

Paperback | 2 August 1995

At a Glance

Paperback
536 Pages

Dimensions(cm)
24.13 x 15.88 x 3.18

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This volume constitutes the proceedings of the Fourth International Workshop on Algorithms and Data Structures, WADS '95, held in Kingston, Canada in August 1995.
The book presents 40 full refereed papers selected from a total of 121 submissions together with invited papers by Preparata and Bilardi, Sharir, Toussaint, and Vitanyi and Li. The book addresses various aspects of algorithms, data structures, computational geometry, scheduling, computational graph theory, and searching.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Algorithms & Data Structures Databases Computer Science Mathematical Theory of Computation Graphical & Digital Media Applications 3D Graphics & Modelling Mathematics Combinatorics & Graph Theory

Lower Bounds to Processor-Time Tradeoffs Under Bounded Speed Message Propagation	p. 1
The Two-Line Center Problem from a Polar View: a New Algorithm and Data Structure	p. 13
On some Geometric Selection and Optimization Problems via Sorted Matrices	p. 26
Load Balancing in Quorum Systems	p. 38
Balanced Distributed Search Trees Do Not Exist	p. 50
Two-Floodlight Illumination of Convex Polygons	p. 62
On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra	p. 74
Scheduling Jobs that Arrive Over Time	p. 86
Dynamic Algorithms for the Dyck Languages	p. 98
Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications	p. 109
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial Time	p. 122
Going Home Through an Unknown Street	p. 135
Page Migration with Limited Local Memory Capacity	p. 147
Randomized Algorithms for Metrical Task Systems	p. 159
Efficient Geometric Algorithms for Workpiece Orientation in 4- and 5 Axis NC Machining	p. 171
Computing Common Tangents Without a Separating Line	p. 183
Online Perfect Matching and Mobile Computing	p. 194
Competitive Algorithms for the On-line Traveling Salesman	p. 206
Quadrangulations of Planar Sets	p. 218
A Linear-time Construction of the Relative Neighborhood Graph within a Histogram	p. 228
Computing Proximity Drawings of Trees in the 3-Dimensional Space	p. 239
Routing on Trees via Matchings	p. 251
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs	p. 263
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues	p. 270
Fast Meldable Priority Queues	p. 282
On the Computation of Fast Data Transmissions in Networks with Capacities and Delays	p. 291
Routing with Delays when Storage is Costly	p. 303
Algorithmic Arguments in Physics of Computation	p. 315
The Buffer Tree: A New Technique for Optimal I/O-Algorithms	p. 334
Experiments on the Practical I/O Efficiency of Geometric Algorithms: Distribution Sweep vs. Plane Sweep	p. 346
Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time	p. 358
A Linear Algorithm for the Maximal Planar Subgraph Problem	p. 369
Topology B-Trees and their Applications	p. 381
In-Place Calculation of Minimum-Redundancy Codes	p. 393
Regular-Factors in the Complements of Partial k-Trees	p. 403
Obstructions to Within a Few Vertices or Edges of Acyclic	p. 415
Faster Enumeration of All Spanning Trees of a Directed Graph	p. 428
A Simpler Minimum Spanning Tree Verification Algorithm	p. 440
On Approximation Properties of the Independent Set Problem in Degree 3 Graphs	p. 449
Approximation of Constraint Satisfaction via Local Search	p. 461
On the Difficulty of Range Searching	p. 473
Tables Should Be Sorted (on random access machines)	p. 482
Improved Length Bounds for the Shortest Superstring Problem	p. 494
Non-Overlapping Local Alignments	p. 506
Experiences with the Implementation of Geometric Algorithms	p. 518
Author Index	p. 519
Table of Contents provided by Blackwell. All Rights Reserved.

Algorithms and Data Structures

4th International Workshop, WADS '95, Kingston, Canada, August 16 - 18, 1995. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Computer Science

Python Crash Course

3rd Edition - A Hands-On, Project-Based Introduction to Programming

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Microsoft 365 Excel For Dummies

For Dummies (Computer/Tech)

The Tech Coup

How to Save Democracy from Silicon Valley

The New Age of Sexism

How the AI Revolution is Reinventing Misogyny

Nexus

A Brief History of Information Networks from the Stone Age to AI

Creative Machines

AI, Art & Us

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

Microsoft 365 Excel All-in-One For Dummies

Excel for Dummies

Python All-in-One For Dummies

3rd Edition

Empire of AI

Inside the reckless race for total domination

Open for Business

Harnessing the Power of Open-Source in the Corporate World

Open for Business

Harnessing the Power of Open-Source in the Corporate World

Artificial Intelligence and Human Rights, Democracy, and the Rule of Law

Computational Intelligence Techniques

The Shortest History of AI

Scary Smart

The Future of Artificial Intelligence and How You Can Save Our World

Generative Artificial Intelligence

Technology and Applications

Driving Intelligence: The Green Book

Routes to Autonomy

Practical Approach to Open Source Intelligence (OSINT)

Volume 2

Handbook of Smart Manufacturing Technologies

Industrial Engineering in the Digital Age

Ideal Subjects Volume 76

The Abstract People of AI

Ideal Subjects Volume 76

The Abstract People of AI

Building Machine Learning Systems with a Feature Store

Batch, Real-Time, and LLM Systems

Hands-On Machine Learning with Scikit-Learn and PyTorch

Concepts, Tools, and Techniques to Build Intelligent Systems

This product is categorised by