↓ Skip to main content

Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Overview of attention for book
Cover of 'Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Correlation Clustering with Partial Information
  3. Altmetric Badge
    Chapter 2 Improved Linear Time Approximation Algorithms for Weighted Matchings
  4. Altmetric Badge
    Chapter 3 Covering Graphs Using Trees and Stars
  5. Altmetric Badge
    Chapter 4 An Improved Decomposition Theorem for Graphs Excluding a Fixed Minor
  6. Altmetric Badge
    Chapter 5 Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
  7. Altmetric Badge
    Chapter 6 Asymmetry in k -Center Variants
  8. Altmetric Badge
    Chapter 7 An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
  9. Altmetric Badge
    Chapter 8 On the Complexity of Approximating k -Dimensional Matching
  10. Altmetric Badge
    Chapter 9 Approximating Market Equilibria
  11. Altmetric Badge
    Chapter 10 Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
  12. Altmetric Badge
    Chapter 11 On the Hardness of Approximate Multivariate Integration
  13. Altmetric Badge
    Chapter 12 A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem
  14. Altmetric Badge
    Chapter 13 Approximating Rooted Connectivity Augmentation Problems
  15. Altmetric Badge
    Chapter 14 Effective Routing and Scheduling in Adversarial Queueing Networks
  16. Altmetric Badge
    Chapter 15 Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement
  17. Altmetric Badge
    Chapter 16 An Improved Algorithm for Approximating the Radii of Point Sets
  18. Altmetric Badge
    Chapter 17 Testing Low-Degree Polynomials over GF (2)
  19. Altmetric Badge
    Chapter 18 Computational Analogues of Entropy
  20. Altmetric Badge
    Chapter 19 Bounds on 2-Query Codeword Testing
  21. Altmetric Badge
    Chapter 20 The Lovász Number of Random Graphs
  22. Altmetric Badge
    Chapter 21 Perfectly Balanced Allocation
  23. Altmetric Badge
    Chapter 22 On Extracting Private Randomness over a Public Channel
  24. Altmetric Badge
    Chapter 23 High Degree Vertices and Eigenvalues in the Preferential Attachment Graph
  25. Altmetric Badge
    Chapter 24 The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems
  26. Altmetric Badge
    Chapter 25 Continuous-Time Quantum Walks on the Symmetric Group
  27. Altmetric Badge
    Chapter 26 Distribution-Free Property Testing
  28. Altmetric Badge
    Chapter 27 On the Graph-Density of Random 0/1-Polytopes
  29. Altmetric Badge
    Chapter 28 A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding
  30. Altmetric Badge
    Chapter 29 Tight Bounds for Testing Bipartiteness in General Graphs
  31. Altmetric Badge
    Chapter 30 Discrete Quantum Walks Hit Exponentially Faster
  32. Altmetric Badge
    Chapter 31 Approximate Testing of Visual Properties
  33. Altmetric Badge
    Chapter 32 Faster Algorithms for MAX CUT and MAX CSP , with Polynomial Expected Time for Sparse Instances
  34. Altmetric Badge
    Chapter 33 A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries
Attention for Chapter 10: Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
Altmetric Badge


4 Dimensions

Readers on

15 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
Chapter number 10
Book title
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Published by
Springer, Berlin, Heidelberg, January 2003
DOI 10.1007/978-3-540-45198-3_10
Book ISBNs
978-3-54-040770-6, 978-3-54-045198-3

Jochen Könemann, Asaf Levin, Amitabh Sinha

Mendeley readers

The data shown below were compiled from readership statistics for 15 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 7%
Canada 1 7%
Unknown 13 87%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 7 47%
Student > Ph. D. Student 3 20%
Lecturer 1 7%
Other 1 7%
Student > Master 1 7%
Other 1 7%
Unknown 1 7%
Readers by discipline Count As %
Computer Science 8 53%
Mathematics 3 20%
Engineering 2 13%
Agricultural and Biological Sciences 1 7%
Unknown 1 7%