Advanced Search
DSpace@MIT

A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems

Research and Teaching Output of the MIT Community

Files in this item

Name Size Format Description
77272768.pdf 2.483Mb PDF Preview, non-printable (open to all)
77272768-MIT.pdf 2.482Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

MIT-Mirage