Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming: Series A and B
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Random Structures & Algorithms
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Structural and algorithmic aspects of massive social networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences - Special issue on FOCS 2003
Vertex cover might be hard to approximate to within 2-ε
Journal of Computer and System Sciences
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Mobile call graphs: beyond power-law and lognormal distributions
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On the hardness and inapproximability of optimization problems on power law graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
| Hi-index | 5.23 |
In this paper we construct an approximation algorithm for the Minimum Vertex Cover (Min-VC) problem with an expected approximation ratio of 2-@z(@b)-1-12^@b2^@b@z(@b-1)@z(@b) for random power-law graphs in the P(@a,@b) model due to Aiello et al. Here @z(@b) is the Riemann zeta function of @b. We obtain this result by combining the Nemhauser and Trotter approach for Min-VC with a new deterministic rounding procedure which achieves an approximation ratio of 32 on a subset of low degree vertices for which the expected contribution to the cost of the associated linear program is sufficiently large.