Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The b-Matching Problem in Hypergraphs: Hardness and Approximability."

Mourad El Ouali, Gerold Jäger (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-31770-5_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoa/OualiJ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoa/OualiJ12
Mourad El Ouali, Gerold Jäger:
The b-Matching Problem in Hypergraphs: Hardness and Approximability. COCOA 2012: 200-211

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.