'Polynomial time approximation' presentation slideshows

Greedy Approximation with Non- submodular Potential Function

Greedy Approximation with Non- submodular Potential Function. Ding-Zhu Du. Chapter 2. Greedy Strategy. III. Nonsubmodular Potential Function. Connected Dominating Set. Given a graph, find a minimum node-subset such that

512 views • 35 slides

The stable marriage problem an example

A 5/3 approximation algorithm for a hard case of stable marriage Rob Irving Computing Science Department University of Glasgow (joint work with David Manlove ). The stable marriage problem an example. m 1 : w 2 w 4 w 1 w 3 w 1 : m 2 m 1 m 4

621 views • 29 slides

Wireless Localization using Self-Organizing Maps

439 views • 27 slides