Reduction rules deliver efficient FPT-algorithms for covering points with lines

doi:10.1145/1498698.1626535

Reduction rules deliver efficient FPT-algorithms for covering points with lines

Full Text:

PDF

Buy this Article

Authors:	Vladimir Estivill-Castro	Griffith University, Australia
	Apichat Heednacram	Griffith University, Australia
	Francis Suraweera	Griffith University, Australia

Published in:

· Journal

Journal of Experimental Algorithmics (JEA) JEA Homepage archive

Volume 14, December 2009
Article No. 7
ACM New York, NY, USA
table of contents doi>10.1145/1498698.1626535

	2010 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 33 · Downloads (cumulative): 179 · Citation Count: 0

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms covering points with lines design experimentation geometrical problems and computations line cover problem parameterized complexity practical fpt-algorithm

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder