We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
This paper reports on a project federally funded by the Australian CRC for Interaction Design (ACID). It investigates the use of a 3D game engine as a landscape metaphor for hosti...
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
: Normally the SISCI interface provides a Distributed Shared Memory (DSM) abstraction using the Scalable Coherent Interface (SCI). This paper describes and discusses the design and...
― This paper describes a new docking system called Compliant-And-Self-Tightening (CAST) developed as an effective and efficient connector for joining and releasing modules of sel...