Algorithms and Computation
Springer Berlin Heidelberg
Chapter title |
Capacitated Domination: Constant Factor Approximations for Planar Graphs
|
---|---|
Chapter number | 51 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2011
|
DOI | 10.1007/978-3-642-25591-5_51 |
Book ISBNs |
978-3-64-225590-8, 978-3-64-225591-5
|
Authors |
Mong-Jen Kao, D. T. Lee |
Country | Count | As % |
---|---|---|
Unknown | 5 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 40% |
Professor > Associate Professor | 1 | 20% |
Lecturer | 1 | 20% |
Student > Doctoral Student | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 60% |
Mathematics | 1 | 20% |
Agricultural and Biological Sciences | 1 | 20% |