Sciweavers

11381 search results - page 190 / 2277
» Connectivity
Sort
View
STACS
2009
Springer
16 years 1 months ago
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
Glencora Borradaile, Erik D. Demaine, Siamak Tazar...
CEC
2009
IEEE
16 years 1 months ago
Plateau Connection Structure and multiobjective metaheuristic performance
—This paper proposes the plateau structure imposed by the Pareto dominance relation as a useful determinant of multiobjective metaheuristic performance. In essence, the dominance...
Deon Garrett
FOCS
2009
IEEE
16 years 1 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
WMCSA
2009
IEEE
16 years 1 months ago
We saw each other on the subway: secure, anonymous proximity-based missed connections
There is an inherent tension between the value provided by Location-Based Services (LBSs) and the location-privacy concerns they raise. Unfortunately, users are often forced to ei...
Justin Manweiler, Ryan Scudellari, Zachary Cancio,...