Back to Results
First PageMeta Content
Logic / Quadrilaterals / Rectangle / Bin / Algorithm / Special case / R-tree / Hilbert R-tree / Packing problem / Mathematical logic / Geometry / Mathematics


CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the d-Runaway Rectangle Escape Problem Aniket Basu Roy∗, Sathish Govindarajan∗, Neeldhara Misra∗, Shreyas Shetty∗ Abstract
Add to Reading List

Document Date: 2014-06-21 03:29:30


Open Document

File Size: 179,72 KB

Share Result on Facebook

City

Halifax / New York / /

Company

Oxford University Press / Ta / /

Country

United States / /

/

Event

Product Recall / Product Issues / /

Facility

Indian Institute of Science / square Hi / square Tℓ / /

IndustryTerm

good approximation algorithm / constant-factor approximation algorithm / approximation algorithm / feasible solution / fixed-parameter tractable algorithm / improved approximation algorithm / proposed algorithm / search space / improved algorithms / /

MusicGroup

Ba / Bi / /

OperatingSystem

Xp / /

Organization

Indian Institute of Science / Department of Computer Science and Automation / Oxford University / /

Person

H. Kong / Xi / Tq / /

Position

guard / rectangles Wb / /

Product

corresponding squares / /

ProvinceOrState

Nova Scotia / New York / /

PublishedMedium

Theoretical Computer Science / /

Technology

constant-factor approximation algorithm / approximation algorithm / fixed-parameter tractable algorithm / time algorithm / J. Algorithms / 2014 4 Parameterized Algorithms / improved approximation algorithm / 3 An Approximation Algorithm / substantially improved algorithms / 2-factor approximation algorithm / provably good approximation algorithm / two-approximation algorithm / /

SocialTag