Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/EvenNRS95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/EvenNRS95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Baruch_Schieber
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Guy_Even
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_Naor
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Satish_Rao
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492463
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1995.492463
>
dc:
identifier
DBLP conf/focs/EvenNRS95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1995.492463
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Baruch_Schieber
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Guy_Even
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_Naor
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Satish_Rao
>
swrc:
pages
62-71
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/EvenNRS95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/EvenNRS95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs95.html#EvenNRS95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1995.492463
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
directed graphs; optimisation; divide and conquer methods; computational complexity; divide-and-conquer approximation algorithms; spreading metrics; NP-hard graph optimization problems; graph optimization problems; fractional spreading metric; polynomial time; fractional lengths; vertices; optimisation problem; spreading metric; polynomial time approximation algorithm; interval graph completion; storage-time product; directed graphs; multicuts
(xsd:string)
dc:
title
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document