↓ Skip to main content
What is this page? Embed badge

WALCOM: Algorithms and Computation

Overview of attention for book
Cover of 'WALCOM: Algorithms and Computation'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Geometry and Topology from Point Cloud Data
  3. Altmetric Badge
    Chapter 2 The Disjoint Paths Problem: Algorithm and Structure
  4. Altmetric Badge
    Chapter 3 The Physarum Computer
  5. Altmetric Badge
    Chapter 4 Maximum Betweenness Centrality: Approximability and Tractable Cases
  6. Altmetric Badge
    Chapter 5 Approximation Algorithms for Minimum Chain Vertex Deletion
  7. Altmetric Badge
    Chapter 6 Oblivious Buy-at-Bulk in Planar Graphs
  8. Altmetric Badge
    Chapter 7 The Complexity of Acyclic Subhypergraph Problems
  9. Altmetric Badge
    Chapter 8 Inapproximability of b -Matching in k -Uniform Hypergraphs
  10. Altmetric Badge
    Chapter 9 WALCOM: Algorithms and Computation
  11. Altmetric Badge
    Chapter 10 Efficient Computation of Time-Dependent Centralities in Air Transportation Networks
  12. Altmetric Badge
    Chapter 11 Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices
  13. Altmetric Badge
    Chapter 12 Minimum Enclosing Circle of a Set of Fixed Points and a Mobile Point
  14. Altmetric Badge
    Chapter 13 Efficient Top- k Queries for Orthogonal Ranges
  15. Altmetric Badge
    Chapter 14 Range-Aggregate Queries Involving Geometric Aggregation Operations
  16. Altmetric Badge
    Chapter 15 Multi Cover of a Polygon Minimizing the Sum of Areas
  17. Altmetric Badge
    Chapter 16 On the Discrete Unit Disk Cover Problem
  18. Altmetric Badge
    Chapter 17 Clustering with Internal Connectedness
  19. Altmetric Badge
    Chapter 18 Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
  20. Altmetric Badge
    Chapter 19 De Bruijn Sequences for the Binary Strings with Maximum Density
  21. Altmetric Badge
    Chapter 20 A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs
  22. Altmetric Badge
    Chapter 21 Counting Spanning Trees in Graphs Using Modular Decomposition
  23. Altmetric Badge
    Chapter 22 On Graceful Labelings of Trees
  24. Altmetric Badge
    Chapter 23 Minimum-Layer Drawings of Trees
Attention for Chapter 8: Inapproximability of b -Matching in k -Uniform Hypergraphs
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
4 Mendeley
Summary Dimensions citations
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
Inapproximability of b -Matching in k -Uniform Hypergraphs
Chapter number 8
Book title
WALCOM: Algorithms and Computation
Published by
Springer, Berlin, Heidelberg, February 2011
DOI 10.1007/978-3-642-19094-0_8
Book ISBNs
978-3-64-219093-3, 978-3-64-219094-0
Authors

Mourad El Ouali, Antje Fretwurst, Anand Srivastav

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Professor > Associate Professor 1 25%
Lecturer 1 25%
Unknown 1 25%
Readers by discipline Count As %
Mathematics 1 25%
Computer Science 1 25%
Agricultural and Biological Sciences 1 25%
Unknown 1 25%

This page is provided by Altmetric.