Search Sciweavers | Sciweavers

We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...

Colin Cooper, Alan M. Frieze

claim paper

Read More »

click to vote

AAIM
2007
Springer

141views Algorithms» more AAIM 2007»

An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem

14 years 4 months ago

Download cs.panam.edu

The disc covering problem asks to cover a set of points on the plane with a minimum number of ﬁx-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...

Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi

claim paper

Read More »

click to vote

COCOA
2008
Springer

165views Discrete Geometry» more COCOA 2008»

Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

13 years 11 months ago

Download www.utdallas.edu

Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...

Zhao Zhang, Xiaofeng Gao, Weili Wu

claim paper

Read More »

click to vote

APPROX
2007
Springer

141views Algorithms» more APPROX 2007»

The Cover Time of Random Digraphs

14 years 4 months ago

Download www.dcs.kcl.ac.uk

We study the cover time of a random walk on the random digraph Dn,p when np =

Colin Cooper, Alan M. Frieze

claim paper