Compression for data archiving and backup revisited
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Accurate network flow measurement is important for a variety of network applications, where the "flow" over an edge in the network is intuitively the rate of data traffic. The problem of efficiently monitoring the network flow can be regarded as finding the minimum weight weak vertex cover for a given graph. In this paper, we present a (2 - frac(2, ν (G)))-approximation algorithm solving for this problem, which improves previous results, where ν (G) is the cyclomatic number of G. © 2006 Elsevier B.V. All rights reserved.
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001