[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/wea/KliemannS09>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Anand_Srivastav>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Lasse_Kliemann>
foaf:homepage <http://dx.doi.org/10.1007%2F978-3-642-02011-7%5F18>
foaf:homepage <http://dx.doi.org/10.1007/978-3-642-02011-7_18>
dc:identifier DBLP conf/wea/KliemannS09 (xsd:string)
dc:identifier DOI 10.1007%2F978-3-642-02011-7%5F18 (xsd:string)
dcterms:issued 2009 (xsd:gYear)
rdfs:label Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. (xsd:string)
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Anand_Srivastav>
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Lasse_Kliemann>
swrc:pages 185-196 (xsd:string)
dcterms:partOf <http://dblp.l3s.de/d2r/resource/publications/conf/wea/2009>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/wea/KliemannS09/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/wea/KliemannS09>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/wea/sea2009.html#KliemannS09>
rdfs:seeAlso <http://dx.doi.org/10.1007/978-3-642-02011-7_18>
swrc:series <http://dblp.l3s.de/d2r/resource/conferences/wea>
dc:subject NP-hard problems; approximation algorithms; hypergraph matching; greedy algorithms; randomized rounding; hybrid algorithms (xsd:string)
dc:title Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document