Sciweavers

65 search results - page 5 / 13
» Nature Reserve Selection Problem: A Tight Approximation Algo...
Sort
View
INFOCOM
2002
IEEE
15 years 2 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
65
Voted
IPM
1998
111views more  IPM 1998»
14 years 9 months ago
Crossover Improvement for the Genetic Algorithm in Information Retrieval
- Genetic algorithms (GAs) search for good solutions to a problem by operations inspired from the natural selection of living beings. Among their many uses, we can count informatio...
Dana Vrajitoru
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 3 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
14 years 11 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
FOCS
2004
IEEE
15 years 1 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...