Generalized Hypergraph Matching via Iterated Packing and Local Ratio.
- University of Southern California
Abstract not provided.
- Research Organization:
- Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000;
- OSTI ID:
- 1502656
- Report Number(s):
- SAND2014-17450PE; 537338
- Conference Information:
- Proposed for presentation at the 12th Workshop on Approximation and Online Algorithms held September 11-12, 2014 in Wroclaw, Poland.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Iterative packing for demand matching and sparse packing.
Approximation algorithms for generalized hypergraph matching problems.
Approximation algorithms for generalized hypergraph matching problems.
Conference
·
2011
·
OSTI ID:1141090
Approximation algorithms for generalized hypergraph matching problems.
Conference
·
2012
·
OSTI ID:1078502
Approximation algorithms for generalized hypergraph matching problems.
Conference
·
2012
·
OSTI ID:1074023