127 research outputs found
Geometric Spanner of Segments (Algorithms and Computation)
Algorithms and computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings ; ISAAC 2007 : (Lecture notes in computer science ; 4835)Proc. of ISACCGeometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider a generalization of the classical geometric spanner problem (called segment spanner): Given a set S of disjoint 2-D segments, find a spanning network G with minimum size so that for any pair of points in S, there exists a path in G with length no more than t times their Euclidean distance. Based on a number of interesting techniques (such as weakly dominating set, strongly dominating set, and interval cover), we present an efficient algorithm to construct the segment spanner. Our approach first identifies a set of Steiner points in S, then construct a point spanner for them. Our algorithm runs in O(|Q|â+ân 2 logn) time, where Q is the set of Steiner points. We show that Q is an O(1)-approximation in terms of its size when S is relatively âwellâ separated by a constant. For arbitrary rectilinear segments under L 1 distance, the approximation ratio improves to 2
2-Stage Fault Tolerant Interval Group Testing
Cicalese F, Amgarten Quitzau JA. 2-Stage Fault Tolerant Interval Group Testing. In: Tokuyama T, ed. Algorithms and Computation. 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings. Lecture notes in computer science, 4835. 2007: 858-868
Self-Evaluation Applied Mathematics 2003-2008 University of Twente
This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008
A Cubic Vertex-Kernel for Trivially Perfect Editing
International audienc
High-Density Solid-State Memory Devices and Technologies
This Special Issue aims to examine high-density solid-state memory devices and technologies from various standpoints in an attempt to foster their continuous success in the future. Considering that broadening of the range of applications will likely offer different types of solid-state memories their chance in the spotlight, the Special Issue is not focused on a specific storage solution but rather embraces all the most relevant solid-state memory devices and technologies currently on stage. Even the subjects dealt with in this Special Issue are widespread, ranging from process and design issues/innovations to the experimental and theoretical analysis of the operation and from the performance and reliability of memory devices and arrays to the exploitation of solid-state memories to pursue new computing paradigms
- âŠ