↓ Skip to main content

Theoretical Computer Science

Overview of attention for book
Cover of 'Theoretical Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Convexity, Duality and Effects
  3. Altmetric Badge
    Chapter 2 A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks
  4. Altmetric Badge
    Chapter 3 The Coarsest Precongruences Respecting Safety and Liveness Properties
  5. Altmetric Badge
    Chapter 4 Entropy and Attack Models in Information Flow
  6. Altmetric Badge
    Chapter 5 Safe Equivalences for Security Properties
  7. Altmetric Badge
    Chapter 6 On Probabilistic Alternating Simulations
  8. Altmetric Badge
    Chapter 7 Probabilistic Mobility Models for Mobile and Wireless Networks
  9. Altmetric Badge
    Chapter 8 On Packing Splittable Items with Cardinality Constraints
  10. Altmetric Badge
    Chapter 9 Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
  11. Altmetric Badge
    Chapter 10 Slicing Behavior Tree Models for Verification
  12. Altmetric Badge
    Chapter 11 Optimization of the Anisotropic Gaussian Kernel for Text Segmentation and Parameter Extraction
  13. Altmetric Badge
    Chapter 12 Online Dictionary Matching for Streams of XML Documents
  14. Altmetric Badge
    Chapter 13 The Duality of Computation under Focus
  15. Altmetric Badge
    Chapter 14 Polarized Resolution Modulo
  16. Altmetric Badge
    Chapter 15 A Logic on Subobjects and Recognizability
  17. Altmetric Badge
    Chapter 16 Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles
  18. Altmetric Badge
    Chapter 17 Proof System for Applied Pi Calculus
  19. Altmetric Badge
    Chapter 18 Concurrent Pattern Calculus
  20. Altmetric Badge
    Chapter 19 Initial Segment Complexities of Randomness Notions
  21. Altmetric Badge
    Chapter 20 Topologies Refining the Cantor Topology on X ω
  22. Altmetric Badge
    Chapter 21 On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
  23. Altmetric Badge
    Chapter 22 Traceable Sets
  24. Altmetric Badge
    Chapter 23 Approximating the Non-contiguous Multiple Organization Packing Problem
  25. Altmetric Badge
    Chapter 24 Improving the Competitive Ratios of the Seat Reservation Problem
  26. Altmetric Badge
    Chapter 25 A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
  27. Altmetric Badge
    Chapter 26 A Game-Theoretic Approach to Routing under Adversarial Conditions
  28. Altmetric Badge
    Chapter 27 An Operational Model for Multiprocessors with Caches
Attention for Chapter 23: Approximating the Non-contiguous Multiple Organization Packing Problem
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

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.
Chapter title
Approximating the Non-contiguous Multiple Organization Packing Problem
Chapter number 23
Book title
Theoretical Computer Science
Published by
Springer, Berlin, Heidelberg, September 2010
DOI 10.1007/978-3-642-15240-5_23
Book ISBNs
978-3-64-215239-9, 978-3-64-215240-5
Authors

Marin Bougeret, Pierre François Dutot, Klaus Jansen, Christina Otte, Denis Trystram

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 %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Professor > Associate Professor 1 50%
Readers by discipline Count As %
Computer Science 2 100%