WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Discrete & Computational Geometry
  2. Discrete & Computational Geometry : Volume 33
  3. Discrete & Computational Geometry : Volume 33, Issue 4, April 2005
  4. Covering Things with Things
Loading...

Please wait, while we are loading the content...

Discrete & Computational Geometry : Volume 57
Discrete & Computational Geometry : Volume 56
Discrete & Computational Geometry : Volume 55
Discrete & Computational Geometry : Volume 54
Discrete & Computational Geometry : Volume 53
Discrete & Computational Geometry : Volume 52
Discrete & Computational Geometry : Volume 51
Discrete & Computational Geometry : Volume 50
Discrete & Computational Geometry : Volume 49
Discrete & Computational Geometry : Volume 48
Discrete & Computational Geometry : Volume 47
Discrete & Computational Geometry : Volume 46
Discrete & Computational Geometry : Volume 45
Discrete & Computational Geometry : Volume 44
Discrete & Computational Geometry : Volume 43
Discrete & Computational Geometry : Volume 42
Discrete & Computational Geometry : Volume 41
Discrete & Computational Geometry : Volume 40
Discrete & Computational Geometry : Volume 39
Discrete & Computational Geometry : Volume 38
Discrete & Computational Geometry : Volume 37
Discrete & Computational Geometry : Volume 36
Discrete & Computational Geometry : Volume 35
Discrete & Computational Geometry : Volume 34
Discrete & Computational Geometry : Volume 33
Discrete & Computational Geometry : Volume 33, Issue 4, April 2005
Generic Global Rigidity
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
Pairs of Convex Bodies with Centrally Symmetric Intersections of Translates
The Envelope of Lines Meeting a Fixed Line and Tangent to Two Spheres
The Topological Representation of Oriented Matroids
Lower Bounds for Simplicial Covers and Triangulations of Cubes
Monotone Paths in Line Arrangements with a Small Number of Directions
On the Lp Minkowski Problem for Polytopes
Covering Things with Things
Discrete & Computational Geometry : Volume 33, Issue 3, March 2005
Discrete & Computational Geometry : Volume 33, Issue 2, February 2005
Discrete & Computational Geometry : Volume 33, Issue 1, January 2005
Discrete & Computational Geometry : Volume 32
Discrete & Computational Geometry : Volume 31
Discrete & Computational Geometry : Volume 30
Discrete & Computational Geometry : Volume 29
Discrete & Computational Geometry : Volume 28
Discrete & Computational Geometry : Volume 27
Discrete & Computational Geometry : Volume 26
Discrete & Computational Geometry : Volume 25
Discrete & Computational Geometry : Volume 24
Discrete & Computational Geometry : Volume 23
Discrete & Computational Geometry : Volume 22
Discrete & Computational Geometry : Volume 21
Discrete & Computational Geometry : Volume 20
Discrete & Computational Geometry : Volume 19
Discrete & Computational Geometry : Volume 18
Discrete & Computational Geometry : Volume 17

Similar Documents

...
Covering Spheres with Spheres

Article

...
Covering with Fat Convex Discs

Article

...
Covering the Plane with Translates of a Triangle

Article

...
Covering Polygonal Annuli by Strips

Article

...
Covering Things with Things

Article

...
Covering Paths for Planar Point Sets

Article

...
Covering a Triangle with Positive and Negative Homothetic Copies

Article

...
Covering the plane with copies of a convex disk

Article

...
Covering Planar Graphs with a Fixed Number of Balls

Article

Covering Things with Things

Content Provider Springer Nature Link
Author Langerman, Stefan Morin, Pat
Copyright Year 2004
Abstract An abstract NP-hard covering problem is presented and fixed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters: $n$ , the number of elements to be covered, $k$ , the number of sets allowed in the covering, and $d$ , the combinatorial dimension of the problem. The first algorithm is deterministic and has a running time of $O’(k^{dk}n)$ . The second algorithm is also deterministic and has a running time of $O’(k^{d(k+1)}+n^{d+1})$ . The third is a Monte-Carlo algorithm that runs in time $O’(\runtime)$ and is correct with probability $1-n^{-c}$ . Here, the $O’$ notation hides factors that are polynomial in $d$ . These algorithms lead to fixed-parameter tractable algorithms for many geometric and non-geometric covering problems.
Starting Page 717
Ending Page 729
Page Count 13
File Format PDF
ISSN 01795376
Journal Discrete & Computational Geometry
Volume Number 33
Issue Number 4
e-ISSN 14320444
Language English
Publisher Springer-Verlag
Publisher Date 2004-07-09
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Computational Mathematics and Numerical Analysis Combinatorics
Content Type Text
Resource Type Article
Subject Discrete Mathematics and Combinatorics Theoretical Computer Science Computational Theory and Mathematics Geometry and Topology
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...