Sciweavers

ESA
2007
Springer
113views Algorithms» more  ESA 2007»
13 years 10 months ago
Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
We introduce a general framework for processing a set of curves defined on a continuous two-dimensional parametric surface, while sweeping the parameter space. We can handle plan...
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehl...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
13 years 10 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
ESA
2007
Springer
143views Algorithms» more  ESA 2007»
13 years 10 months ago
Two's Company, Three's a Crowd: Stable Family and Threesome Roommates Problems
We investigate Knuth’s eleventh open question on stable matchings. In the stable family problem, sets of women, men, and dogs are given, all of whom state their preferences among...
Chien-Chung Huang
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
13 years 10 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
ESA
2007
Springer
99views Algorithms» more  ESA 2007»
13 years 10 months ago
Solutions to Real-World Instances of PSPACE-Complete Stacking
Felix G. König, Marco E. Lübbecke, Rolf ...
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
13 years 10 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir
ESA
2007
Springer
101views Algorithms» more  ESA 2007»
13 years 10 months ago
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
Haim Kaplan, Natan Rubin, Micha Sharir
ESA
2007
Springer
117views Algorithms» more  ESA 2007»
13 years 10 months ago
Estimating Clustering Indexes in Data Streams
Luciana S. Buriol, Gereon Frahling, Stefano Leonar...