Show simple item record

dc.contributor.authorLiang, Percy
dc.contributor.authorSrebro, Nati
dc.contributor.otherAlgorithms
dc.date.accessioned2005-12-22T02:20:23Z
dc.date.available2005-12-22T02:20:23Z
dc.date.issued2005-01-03
dc.identifier.otherMIT-CSAIL-TR-2005-002
dc.identifier.otherMIT-LCS-TR-978
dc.identifier.urihttp://hdl.handle.net/1721.1/30515
dc.description.abstractCurrent approximation algorithms for maximum weight {\em hypertrees} find heavy {\em windmill farms}, and are based on the fact that a constant ratio (for constant width $k$) of the weight of a $k$-hypertree can be captured by a $k$-windmill farm. However, the exact worst case ratio is not known and is only bounded to be between $1/(k+1)!$ and $1/(k+1)$. We investigate this worst case ratio by searching for weighted hypertrees that minimize the ratio of their weight that can be captured with a windmill farm. To do so, we use a novel approach in which a linear program is used to find ``bad'' inputs to a dynamic program.
dc.format.extent12 p.
dc.format.extent13845223 bytes
dc.format.extent531507 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.titleHow Much of a Hypertree can be Captured by Windmills?


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record