Finding Dense Subgraphs with Semidefinite Programming. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/approx/SrivastavW98>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Anand_Srivastav>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Katja_Wolf>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1007%2FBFb0053974>
foaf:homepage	<https://doi.org/10.1007/BFb0053974>
dc:identifier	DBLP conf/approx/SrivastavW98 (xsd:string)
dc:identifier	DOI doi.org%2F10.1007%2FBFb0053974 (xsd:string)
dcterms:issued	1998 (xsd:gYear)
rdfs:label	Finding Dense Subgraphs with Semidefinite Programming. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Anand_Srivastav>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Katja_Wolf>
swrc:pages	181-191 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/approx/1998>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/approx/SrivastavW98/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/approx/SrivastavW98>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/approx/approx1998.html#SrivastavW98>
rdfs:seeAlso	<https://doi.org/10.1007/BFb0053974>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/approx>
dc:subject	Subgraph Problem, Approximation Algorithms, Randomized Algorithms, Semidefinite Programming. (xsd:string)
dc:title	Finding Dense Subgraphs with Semidefinite Programming. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document