[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeigeK00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Robert_Krauthgamer>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Uriel_Feige>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.2000.892070>
foaf:homepage <https://doi.org/10.1109/SFCS.2000.892070>
dc:identifier DBLP conf/focs/FeigeK00 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.2000.892070 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label A polylogarithmic approximation of the minimum bisection. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Robert_Krauthgamer>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Uriel_Feige>
swrc:pages 105-115 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/FeigeK00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/FeigeK00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs2000.html#FeigeK00>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.2000.892070>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject computational complexity; graph theory; computational geometry; polylogarithmic approximation; minimum bisection; graph; vertices; vertex partitioning; bisection cost; edges; complexity; approximation ratio (xsd:string)
dc:title A polylogarithmic approximation of the minimum bisection. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document