Back to Results
First PageMeta Content
NP-complete problems / Delaunay triangulation / Triangulation / Maximum flow problem / Cut / Shortest path problem / Graph theory / Mathematics / Theoretical computer science


CCCG 2009, Vancouver, BC, August 17–19, 2009 Approximating Maximum Flow in Polygonal Domains using Spanners Joondong Kim ∗
Add to Reading List

Document Date: 2009-09-02 14:32:58

Open Document

File Size: 158,89 KB

Share Result on Facebook

City

Delaunay / London / Vancouver / /

Country

United Kingdom / /

/

Facility

Stony Brook University / /

IndustryTerm

air traffic management / near-linear time simple algorithm / computing / sensor networks / weather systems / approximation algorithms / propagation algorithm / /

Organization

National Aeronautics and Space Administration / National Science Foundation / Stony Brook University / /

Person

S. B. Mitchell / V / Valentin Polishchuk / Joseph S.B. Mitchell Abstract / Girishkumar Sabhnani / /

ProvinceOrState

British Columbia / /

Technology

approximation algorithms / http / ATM / 1/2-approximation algorithm / propagation algorithm / pdf / /

SocialTag