1814 search results - page 24 / 363 » Improved Results on Geometric Hitting Set Problems |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
JAMIA
2010
13 years 2 months ago
2010
Objective Lack of dose adjustment for renally cleared drugs in the presence of poor renal function is a common problem in the hospital setting. The absence of a clinical decision ...
GD
2009
Springer
14 years 10 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
ICDE
2006
IEEE
14 years 9 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...