Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Springer, Berlin, Heidelberg
Chapter title |
Improved Inapproximability for Submodular Maximization
|
---|---|
Chapter number | 2 |
Book title |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
|
Published by |
Springer, Berlin, Heidelberg, January 2010
|
DOI | 10.1007/978-3-642-15369-3_2 |
Book ISBNs |
978-3-64-215368-6, 978-3-64-215369-3
|
Authors |
Per Austrin |
Country | Count | As % |
---|---|---|
United States | 2 | 40% |
Unknown | 3 | 60% |
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 2 | 40% |
Student > Ph. D. Student | 1 | 20% |
Researcher | 1 | 20% |
Student > Postgraduate | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 80% |
Engineering | 1 | 20% |