1941 search results - page 262 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
182
click to vote
COCOON
2003
Springer
16 years 5 days ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
167
Voted
COMPGEOM
2010
ACM
16 years 1 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
186
click to vote
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
Efficient and reliable power allocation algorithm in Cognitive radio (CR) networks is a challenging problem. Traditional water-filling algorithm is inefficient for CR networks due ...
176
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
215
Voted
FLAIRS
2006
15 years 8 months ago
2006
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...