151 search results - page 29 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
158
click to vote
LICS
2008
IEEE
15 years 12 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
149
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
166
click to vote
PODC
2011
ACM
14 years 8 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
133
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
178
click to vote
FOCS
2008
IEEE
15 years 12 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:...