Back to Results
First PageMeta Content
Applied mathematics / Computational complexity theory / Quadrilaterals / Rectangle / Matrix / Dominating set / Vertex cover / Parameterized complexity / Clique / Theoretical computer science / NP-complete problems / Mathematics


Originally published in Proc. 3rd WALCOM, LNCS. Springer, 2009. To appear. Parameterized Complexity of Stabbing Rectangles and Squares in the Plane Michael Dom1 and Michael R. Fellows2,⋆ and Frances A. Rosamond2,⋆ 1
Add to Reading List

Document Date: 2008-12-19 10:15:00


Open Document

File Size: 204,53 KB

Share Result on Facebook

City

Jena / /

Company

Vertex / /

Country

Australia / Germany / /

/

Facility

University of Newcastle / Square Stabbing / /

IndustryTerm

recursive algorithm / factor-d approximation algorithm / sensor networks / size-k solution / approximation algorithms / /

Organization

Australian Research Council / Bonn / Institut f¨ / University of Newcastle / office of DVC / /

Person

Michael R. Fellows / /

Technology

approximation algorithms / factor-d approximation algorithm / dom / recursive algorithm / /

SocialTag