Date: 2013-09-19 09:13:08

NP-complete problems

Approximation algorithm

Submodular set function

Shortest path problem

Bin packing problem

Vertex cover

Dominating set

Independent set

Computational complexity theory

Theoretical computer science

Graph theory

Mathematics

SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

File Size: 63,35 KB