Sciweavers

316 search results - page 18 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 8 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
PODC
2006
ACM
14 years 1 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 7 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
EKAW
2004
Springer
14 years 26 days ago
A Hybrid Algorithm for Alignment of Concept Hierarchies
Hierarchical categorization is a powerful and convenient method so that it is commonly used in various areas, such as ontologies. Although each hierarchy is useful, there are probl...
Ryutaro Ichise, Masahiro Hamasaki, Hideaki Takeda