Sciweavers

1566 search results - page 140 / 314
» On a Cone Covering Problem
Sort
View
DM
1998
81views more  DM 1998»
15 years 4 months ago
On intersecting hypergraphs
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
Barry Guiduli, Zoltán Király
ACSC
2003
IEEE
15 years 10 months ago
User Hints for Map Labelling
The Map Labelling Problem appears in several applications, mainly in Cartography. Although much research on this problem has been done, it is interesting to note that map-labellin...
Hugo A. D. do Nascimento, Peter Eades
INFOCOM
1998
IEEE
15 years 9 months ago
Demand-based Radio Network Planning of Cellular Mobile Communication Systems
: This paper presents a demand-based engineering method for designing radio networks of cellularmobile communicationsystems. The proposed procedure is based on a forward-engineerin...
Kurt Tutschku
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
15 years 8 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
AIPS
2009
15 years 5 months ago
The Influence of k-Dependence on the Complexity of Planning
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
Omer Giménez, Anders Jonsson