Sciweavers

2181 search results - page 111 / 437
» The restriction scaffold problem
Sort
View
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
13 years 11 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
AI
1998
Springer
13 years 9 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 9 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
WWW
2008
ACM
14 years 10 months ago
Privacy-enhanced sharing of personal content on the web
Publishing personal content on the web is gaining increased popularity with dramatic growth in social networking websites, and availability of cheap personal domain names and host...
Mohammad Mannan, Paul C. van Oorschot
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
14 years 3 months ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...