A polynomial Time Randomized Parallel Approximation Algorithm for Finding Heavy Planar Subgraphs
Year: 2006
Type: dissertation
Source: MPG.PuRe (Max Planck Society)
Authors: Vitali Osipov, Markus Bläser
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W1476392009
