JCO 2010 - PDF Preprint Papers

JCO 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JCO-2010 Paper

click to vote

JCO
2010

182views more JCO 2010»

Polynomial time approximation schemes for minimum disk cover problems

13 years 11 months ago

Download www.ece.mtu.edu

The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...

Chen Liao, Shiyan Hu

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	182	Polynomial time approximation schemes for minimum disk cover problems	claim
2	169	An almost four-approximation algorithm for maximum weight triangulation	claim
3	123	Capacity inverse minimum cost flow problem	claim
4	101	Separator-based data reduction for signed graph balancing	claim
5	100	A class of error-correcting pooling designs over complexes	claim
6	99	Online scheduling with a buffer on related machines	claim
7	97	Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence	claim
8	90	The arrangement of subspaces in the orthogonal spaces and tighter analysis of an error-tolerant pooling design	claim
9	87	On-line machine scheduling with batch setups	claim
10	84	Algorithms for storage allocation based on client preferences	claim
11	82	Embedded paths and cycles in faulty hypercubes	claim
12	80	Constructing error-correcting pooling designs with symplectic space	claim
13	79	New error-correcting pooling designs associated with finite vector spaces	claim
14	77	Two constructions of new error-correcting pooling designs from orthogonal spaces over a finite field of characteristic 2	claim
15	75	A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor	claim
16	70	Worst-case analysis for on-line service policies	claim
17	67	Galaxy cutsets in graphs	claim
18	56	Linear time construction of 5-phylogenetic roots for tree chordal graphs	claim
19	43	Keeping partners together: algorithmic results for the hospitals/residents problem with couples	claim
20	43	Pooling designs associated with unitary space and ratio efficiency comparison	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers