2477 search results - page 152 / 496 » Approximate extended formulations |
130
click to vote
ICNP
2006
IEEE
15 years 10 months ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
156
click to vote
APPROX
2006
Springer
15 years 8 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
163
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
120
click to vote
TIT
2008
15 years 4 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
107
click to vote
AMC
2007
15 years 4 months ago
2007
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...