Skip to main content

Generalized Hypergraph Matching via Iterated Packing and Local Ratio.

Conference · Mon Sep 01 04:00:00 EDT 2014

DOI:https://doi.org/10.1007/978-3-319-18263-6_18· OSTI ID:1502656

Parekh, Ojas D.; Pritchard, David ^[1]

University of Southern California

Abstract not provided.

View Conference

Print

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

Country of Publication:: United States

Language:: English

Similar Records

Iterative packing for demand matching and sparse packing.

Conference · Wed Jun 01 00:00:00 EDT 2011 · OSTI ID:1141090

Approximation algorithms for generalized hypergraph matching problems.

Conference · Sun Apr 01 00:00:00 EDT 2012 · OSTI ID:1078502

Approximation algorithms for generalized hypergraph matching problems.

Conference · Sun Apr 01 00:00:00 EDT 2012 · OSTI ID:1074023

Related Subjects