Sciweavers

324 search results - page 27 / 65
» Distance Approximating Trees: Complexity and Algorithms
Sort
View
COMPGEOM
2005
ACM
13 years 9 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
NETWORKS
2010
13 years 5 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
INFOCOM
2012
IEEE
11 years 9 months ago
Robust multi-source network tomography using selective probes
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...
Akshay Krishnamurthy, Aarti Singh
STACS
2001
Springer
13 years 12 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 28 days ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener