Approximation Algorithm For Maximum Independent Set Of Rectangles By Arindam Khan Iisc, Bangalore
Synopsis
Maximum Independent Set of Rectangles (MISR) is a fundamental problem in computational geometry, approximation algorithms, ...
You Might Also Like
![Maximum Independent Set of Rectangles (Part 1) -- SODA'22 [Arindam Khan, IISc]](https://i.ytimg.com/vi/idjvq16D0r0/hqdefault.jpg?sqp=-oaymwE2COADEI4CSFXyq4qpAygIARUAAIhCGAFwAcABBvABAfgB_gSAAugCigIMCAAQARhlIGUoZTAP&rs=AOn4CLAfhSGdTo3Ok6zuX1N_FUEVm1X2mA)
![Maximum Independent Set of Rectangles (Part 2) -- SODA'22 [Arindam Khan, IISc]](https://i.ytimg.com/vi/BL6RZvVIlm0/hqdefault.jpg?sqp=-oaymwE2COADEI4CSFXyq4qpAygIARUAAIhCGAFwAcABBvABAfgB_gSAAugCigIMCAAQARhlIGUoZTAP&rs=AOn4CLAK8InN-AA5LzTGg5-fhbspNZAxew)
Download Options
Choose a download method below. All links open in new tabs.
| Service | Features | Action |
|---|---|---|
| Ssvid |
MP4 & MP3 • HD Quality • Browser Extension Available
|
Download |
| SaveFrom |
MP4 & MP3 • HD Quality • Browser Extension Available
|
Download |
Security Notice: These are third-party services. We recommend using antivirus software and being cautious of pop-up ads.