2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/numta/KelmanovKP19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/numta/KelmanovKP19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Kel%27manov
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Anna_Panasenko
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Sergey_A._Khamidullin
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-030-40616-5%5F34
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-030-40616-5_34
>
dc:
identifier
DBLP conf/numta/KelmanovKP19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-030-40616-5%5F34
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
rdfs:
label
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Alexander_Kel%27manov
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Anna_Panasenko
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Sergey_A._Khamidullin
>
swrc:
pages
386-393
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/numta/2019-2
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/numta/KelmanovKP19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/numta/KelmanovKP19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/numta/numta2019-2.html#KelmanovKP19
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-030-40616-5_34
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/numta
>
dc:
title
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document