Back to Results
First PageMeta Content
Mathematics / Dominating set / Unit disk graph / Independent set / APX / Approximation algorithm / Vertex cover / Planar separator theorem / Theoretical computer science / Graph theory / NP-complete problems


CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†
Add to Reading List

Document Date: 2011-08-06 04:11:13


Open Document

File Size: 197,44 KB

Share Result on Facebook

City

Kolkata / Freeman / /

Company

OP TA / /

Country

Canada / India / /

Currency

pence / /

/

Facility

India Carleton University / Indian Statistical Institute / Indian Institute of Technology Guwahati / /

IndustryTerm

factor approximation solution / improved line-separable algorithm / approximation algorithm / 3factor solution / image processing / a lot of applications / wireless ad hoc networks / constant factor approximation algorithms / factor approximation algorithm / approximation solution / Online Algorithms / above algorithm / optimum solution / tractable algorithm / wireless networks / wireless communication / approximation algorithms / /

Organization

Indian Institute of Technology Guwahati / Carleton University / Indian Statistical Institute / /

ProvinceOrState

New York / /

PublishedMedium

Journal of the ACM / Theoretical Computer Science / Theory of Computing / /

Technology

above algorithm / 3-factor approximation algorithm / existing algorithm / proposed algorithm / approximation algorithm / 3-factor approximation algorithms / 5-factor approximation algorithm / 2011 Approximation Algorithms / 14-factor approximation algorithm / tractable algorithm / factor approximation algorithm / 18-factor approximation algorithm / image processing / improved line-separable algorithm / constant factor approximation algorithms / 4-factor approximation algorithm / 2 Approximation Algorithms / /

SocialTag