11345 search results - page 1809 / 2269 » Foundations of Computer Science |
138
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
143
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
172
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
170
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
127
click to vote
ICYCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Context-aware service platforms use context information to customize their services to the current users’ situation. Due to technical limitations in sensors and context reasonin...