↓ Skip to main content

Combinatorial Algorithms

Overview of attention for book
Cover of 'Combinatorial Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Multi-priority Graph Sparsification
  3. Altmetric Badge
    Chapter 2 Point Enclosure Problem for Homothetic Polygons
  4. Altmetric Badge
    Chapter 3 Hardness of  Balanced Mobiles
  5. Altmetric Badge
    Chapter 4 Burn and Win
  6. Altmetric Badge
    Chapter 5 Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness
  7. Altmetric Badge
    Chapter 6 Advice Complexity Bounds for Online Delayed $$\mathcal{F}$$ F -Node-, H -Node- and H -Edge-Deletion Problems
  8. Altmetric Badge
    Chapter 7 Parameterized Algorithms for Eccentricity Shortest Path Problem
  9. Altmetric Badge
    Chapter 8 A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
  10. Altmetric Badge
    Chapter 9 Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
  11. Altmetric Badge
    Chapter 10 A Polyhedral Perspective on Tropical Convolutions
  12. Altmetric Badge
    Chapter 11 Online Knapsack with Removal and Recourse
  13. Altmetric Badge
    Chapter 12 Minimum Surgical Probing with Convexity Constraints
  14. Altmetric Badge
    Chapter 13 A Linear Algorithm for Radio k -Coloring Powers of Paths Having Small Diameter
  15. Altmetric Badge
    Chapter 14 Capacity-Preserving Subgraphs of Directed Flow Networks
  16. Altmetric Badge
    Chapter 15 Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
  17. Altmetric Badge
    Chapter 16 Finding Small Complete Subgraphs Efficiently
  18. Altmetric Badge
    Chapter 17 Maximal Distortion of Geodesic Diameters in Polygonal Domains
  19. Altmetric Badge
    Chapter 18 On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems
  20. Altmetric Badge
    Chapter 19 Make a Graph Singly Connected by Edge Orientations
  21. Altmetric Badge
    Chapter 20 Computing the Center of Uncertain Points on Cactus Graphs
  22. Altmetric Badge
    Chapter 21 Cosecure Domination: Hardness Results and Algorithms
  23. Altmetric Badge
    Chapter 22 Optimal Cost-Based Allocations Under Two-Sided Preferences
  24. Altmetric Badge
    Chapter 23 Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders
  25. Altmetric Badge
    Chapter 24 On Computing Large Temporal (Unilateral) Connected Components
  26. Altmetric Badge
    Chapter 25 On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings
  27. Altmetric Badge
    Chapter 26 Finding Perfect Matching Cuts Faster
  28. Altmetric Badge
    Chapter 27 Connected Feedback VertexSet on AT-Free Graphs
  29. Altmetric Badge
    Chapter 28 Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
  30. Altmetric Badge
    Chapter 29 Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing
  31. Altmetric Badge
    Chapter 30 Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism
  32. Altmetric Badge
    Chapter 31 A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs
  33. Altmetric Badge
    Chapter 32 Partial-Adaptive Submodular Maximization
  34. Altmetric Badge
    Chapter 33 Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform
Attention for Chapter 3: Hardness of  Balanced Mobiles
Altmetric Badge

Mentioned by

twitter
2 X users
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
Hardness of  Balanced Mobiles
Chapter number 3
Book title
Combinatorial Algorithms
Published by
Springer, Cham, January 2023
DOI 10.1007/978-3-031-34347-6_3
Book ISBNs
978-3-03-134346-9, 978-3-03-134347-6
Authors

Ardévol Martínez, Virginia, Rizzi, Romeo, Sikora, Florian

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.