Search Results - f.2.2 [analysis of algorithms AND problem complexity]: nonnumerical algorithms AND problems~

Mandatory Critical Points of 2D Uncertain Scalar Fields by Günther, David, Salmon, Joseph, Tierny, Julien

“… The characterization is based on the analysis of the support of the probability density functions (PDF) of the input data. Given two scalar fields representing reliable estimations…”
Get full text

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions by Larsson, Thomas, Källberg, Linus

“…In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension…”
Get full text

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams by Bennett, H., Papadopoulou, E., Yap, C.

“… We describe a subdivision algorithm for computing a clustered ε‐isotopic approximation of the minimization diagram of X…”
Get full text

New Bounds on the Size of Optimal Meshes by Sheehy, Donald R.

“…The theory of optimal size meshes gives a method for analyzing the output size (number of simplices) of a Delaunay refinement mesh in terms of the integral of…”
Get full text

Improved grid map layout by point set matching by Eppstein, David, van Kreveld, Marc, Speckmann, Bettina, Staals, Frank

“…Associating the regions of a geographic subdivision with the cells of a grid is a basic operation that is used in various types of maps, like spatially ordered…”
Get full text

Approximate topological matching of quadrilateral meshes by Eppstein, D., Goodrich, M.T., Kim, E., Tamstorf, R.

“…We study approximate topological matching of quadrilateral meshes, that is, the problem of finding as large a set as possible of matching portions of two quadrilateral meshes…”
Get full text

A new approach to rectangle intersections part I by Edelsbrunner, Herbert

“…Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data…”
Get full text

A new approach to rectangle intersections: Part II by Edelsbrunner, Herbert

“…The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions…”
Get full text

Counter examples to adjudicating a towers of hanoi contest by Er, M.C.

“…This paper points out the inconsistency in the criteria for adjudicating a Towers of Hanoi contest proposed by Wood. Counter examples to some of Wood's claims…”
Get full text

Adjudicating a towers of hanoi contest by Wood, D.

“…The notion of a Towers of Hanoi contest is introduced and the complexity of some adjudication methods are investigated…”
Get full text

The multiway trees of hanoi by Jürgensen, Helmut, Wood, Derick

“…We consider the multiway generalisation of the binary Trees of Hanoi. We provide a recursive algorithm for its solution and prove its optimality…”
Get full text

Faster Graph Coloring in Polynomial Space by Gaspers, Serge, Lee, Edward J.

“… Together with the inclusion-exclusion approach of Björklund, Husfeldt, and Koivisto [SIAM J. Comput. 2009], this leads to a faster polynomial-space algorithm for the graph coloring problem with running time O…”
Get full text

Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms by Murray, Riley, Khuller, Samir, Chao, Megan

“… . We consider a scheduling problem to minimize weighted average completion time of n jobs on m distributed clusters of parallel machines…”
Get full text

Towers of hanoi problem with arbitrary k≧3 pages by Xue-Miao, Lu

“… In this paper we present a nice recursive algorithm for this extended problem and then analyze its complexity…”
Get full text

A study of binary tree traversal algorithms and a tag-free threaded representation by Fenner, T.I., Loizou, G.

“…Starting from a stack-based binary tree traversal algorithm for preorder and/or inorder, we derive an algorithm recently discovered by J. M…”
Get full text

The average performance analysis of a closest-pair algorithm by Chang, R. C., Lee, R. C. T.

“…Bentley proposed a divide-and-conquer approach to solve the planar closest pair problem…”
Get full text

The Complexity of Coverability in ν-Petri Nets by Lazic, Ranko, Schmitz, Sylvain

“… ideals.Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems…”
Get full text

Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories by Spyropoulos, C.D., Evans, D.J

“… Further, an algorithm, based on the idea of Q.A.D., with complexity 0(n 2 ) is introduced that produces schedules with minimum mean-flow time…”
Get full text

Optimal Algorithms for Compact Linear Layouts by Sonke, Willem, Verbeek, Kevin, Meulemans, Wouter, Verbeek, Eric, Speckmann, Bettina

“… In this paper we present a novel and versatile algorithm to optimally fold a linear layout of a graph such that it…”
Get full text