Sciweavers

8413 search results - page 532 / 1683
» Ordering Problem Subgoals
Sort
View
COMPGEOM
2006
ACM
16 years 26 days ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
ISAAC
2009
Springer
113views Algorithms» more  ISAAC 2009»
15 years 11 months ago
On Shortest Disjoint Paths in Planar Graphs
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
Yusuke Kobayashi, Christian Sommer 0002
DEXA
2009
Springer
153views Database» more  DEXA 2009»
15 years 10 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
15 years 10 months ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
CPAIOR
2008
Springer
15 years 8 months ago
Connections in Networks: A Hybrid Approach
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...