667 search results - page 72 / 134 » Approximation algorithms for connected facility location pro... |
93
Voted
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
115
click to vote
COMPGEOM
2005
ACM
15 years 2 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
90
Voted
SAINT
2005
IEEE
15 years 6 months ago
2005
IEEE
This paper presents the "auto-transition" concept which tries to ensure that any network device can obtain IPv6 connectivity at any time and whatever network is attached...
125
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
104
click to vote
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...