Sciweavers

115 search results - page 16 / 23
» Hardness and Approximation Results for Packing Steiner Trees
Sort
View
NETWORKING
2007
13 years 11 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen
COCOA
2009
Springer
14 years 2 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 10 months ago
Facility Location with Client Latencies: Linear-Programming based Techniques for Minimum-Latency Problems
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...
Deeparnab Chakrabarty, Chaitanya Swamy
WG
2007
Springer
14 years 3 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
NIPS
2001
13 years 11 months ago
Bayesian morphometry of hippocampal cells suggests same-cell somatodendritic repulsion
Visual inspection of neurons suggests that dendritic orientation may be determined both by internal constraints (e.g. membrane tension) and by external vector fields (e.g. neurotr...
Giorgio A. Ascoli, Alexei V. Samsonovich