Sciweavers

217 search results - page 8 / 44
» Deterministic Algorithm for the t-Threshold Set Problem
Sort
View
ISAAC
2000
Springer
178views Algorithms» more  ISAAC 2000»
13 years 11 months ago
Simple Algorithms for a Weighted Interval Selection Problem
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
Thomas Erlebach, Frits C. R. Spieksma
CCE
2004
13 years 7 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
JPDC
2006
187views more  JPDC 2006»
13 years 7 months ago
On constructing k-connected k-dominating set in wireless ad hoc and sensor networks
An important problem in wireless ad hoc and sensor networks is to select a few nodes to form a virtual backbone that supports routing and other tasks such as area monitoring. Prev...
Fei Dai, Jie Wu
COCOON
2005
Springer
13 years 9 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
13 years 9 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler