↓ Skip to main content

Combinatorial Optimization and Applications

Overview of attention for book
Cover of 'Combinatorial Optimization and Applications'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Coverage with k -Transmitters in the Presence of Obstacles
  3. Altmetric Badge
    Chapter 2 On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem
  4. Altmetric Badge
    Chapter 3 Reducing the Maximum Latency of Selfish Ring Routing via Pairwise Cooperations
  5. Altmetric Badge
    Chapter 4 Constrained Surface-Level Gateway Placement for Underwater Acoustic Wireless Sensor Networks
  6. Altmetric Badge
    Chapter 5 Time Optimal Algorithms for Black Hole Search in Rings
  7. Altmetric Badge
    Chapter 6 Strong Connectivity in Sensor Networks with Given Number of Directional Antennae of Bounded Angle
  8. Altmetric Badge
    Chapter 7 A Constant-Factor Approximation Algorithm for the Link Building Problem
  9. Altmetric Badge
    Chapter 8 XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme
  10. Altmetric Badge
    Chapter 9 Computational Study for Planar Connected Dominating Set Problem
  11. Altmetric Badge
    Chapter 10 Bounds for Nonadaptive Group Tests to Estimate the Amount of Defectives
  12. Altmetric Badge
    Chapter 11 A Search-Based Approach to the Railway Rolling Stock Allocation Problem
  13. Altmetric Badge
    Chapter 12 Approximation Algorithm for the Minimum Directed Tree Cover
  14. Altmetric Badge
    Chapter 13 An Improved Approximation Algorithm for Spanning Star Forest in Dense Graphs
  15. Altmetric Badge
    Chapter 14 A New Result on [ k , k  + 1]-Factors Containing Given Hamiltonian Cycles
  16. Altmetric Badge
    Chapter 15 Yao Graphs Span Theta Graphs
  17. Altmetric Badge
    Chapter 16 A Simpler Algorithm for the All Pairs Shortest Path Problem with O ( n 2 log n ) Expected Time
  18. Altmetric Badge
    Chapter 17 New Min-Max Theorems for Weakly Chordal and Dually Chordal Graphs
  19. Altmetric Badge
    Chapter 18 A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
  20. Altmetric Badge
    Chapter 19 Fast Edge-Searching and Related Problems
  21. Altmetric Badge
    Chapter 20 Diameter-Constrained Steiner Tree
  22. Altmetric Badge
    Chapter 21 Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks
  23. Altmetric Badge
    Chapter 22 A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree
  24. Altmetric Badge
    Chapter 23 Constrained Low-Interference Relay Node Deployment for Underwater Acoustic Wireless Sensor Networks
  25. Altmetric Badge
    Chapter 24 Structured Overlay Network for File Distribution
  26. Altmetric Badge
    Chapter 25 Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations
  27. Altmetric Badge
    Chapter 26 The Networked Common Goods Game
  28. Altmetric Badge
    Chapter 27 Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes
  29. Altmetric Badge
    Chapter 28 Listing Triconnected Rooted Plane Graphs
  30. Altmetric Badge
    Chapter 29 Bipartite Permutation Graphs Are Reconstructible
  31. Altmetric Badge
    Chapter 30 A Transformation from PPTL to S1S
  32. Altmetric Badge
    Chapter 31 Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
  33. Altmetric Badge
    Chapter 32 Approximate Ellipsoid in the Streaming Model
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • Good Attention Score compared to outputs of the same age (78th percentile)
  • Good Attention Score compared to outputs of the same age and source (78th percentile)

Mentioned by

twitter
1 X user
wikipedia
3 Wikipedia pages
q&a
1 Q&A thread

Readers on

mendeley
2 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.
Title
Combinatorial Optimization and Applications
Published by
ADS, December 2010
DOI 10.1007/978-3-642-17461-2
ISBNs
978-3-64-217460-5, 978-3-64-217461-2
Editors

Wu, Weili, Daescu, Ovidiu

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 50%
Hungary 1 50%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 100%
Student > Master 1 50%
Student > Postgraduate 1 50%
Researcher 1 50%
Readers by discipline Count As %
Computer Science 3 150%
Business, Management and Accounting 1 50%
Biochemistry, Genetics and Molecular Biology 1 50%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 13 May 2022.
All research outputs
#5,520,702
of 23,041,514 outputs
Outputs from ADS
#6,991
of 37,451 outputs
Outputs of similar age
#39,773
of 181,870 outputs
Outputs of similar age from ADS
#142
of 665 outputs
Altmetric has tracked 23,041,514 research outputs across all sources so far. Compared to these this one has done well and is in the 75th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 37,451 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done well, scoring higher than 81% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 181,870 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 78% of its contemporaries.
We're also able to compare this research output to 665 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 78% of its contemporaries.