A parallel local-search algorithm for the k-partitioning problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/hicss/DiekmannLMS95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/hicss/DiekmannLMS95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Burkhard_Monien
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Carsten_Spr%E2%88%9A%C2%A7ner
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ralf_Diekmann
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Reinhard_L%E2%88%9A%C4%BEling
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FHICSS.1995.375478
>
foaf:
homepage
<
https://doi.org/10.1109/HICSS.1995.375478
>
dc:
identifier
DBLP conf/hicss/DiekmannLMS95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FHICSS.1995.375478
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
A parallel local-search algorithm for the k-partitioning problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Burkhard_Monien
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Carsten_Spr%E2%88%9A%C2%A7ner
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ralf_Diekmann
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Reinhard_L%E2%88%9A%C4%BEling
>
swrc:
pages
41-50
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/hicss/1995
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/hicss/DiekmannLMS95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/hicss/DiekmannLMS95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/hicss/hicss1995.html#DiekmannLMS95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/HICSS.1995.375478
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/hicss
>
dc:
subject
parallel algorithms; search problems; graph theory; computational complexity; heuristic programming; parallel local-search algorithm; k-partitioning problem; solution quality; heuristics; helpful sets; graph bisection; abstraction technique; runtime dynamic graph shrinking; computation times; stochastic methods; parallel efficiency; MIMD systems; processor numbers
(xsd:string)
dc:
title
A parallel local-search algorithm for the k-partitioning problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document