A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jacm/BalasMPT91
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jacm/BalasMPT91
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Donald_L._Miller
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Egon_Balas
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_F._Pekny
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Paolo_Toth
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F115234.115349
>
foaf:
homepage
<
https://doi.org/10.1145/115234.115349
>
dc:
identifier
DBLP journals/jacm/BalasMPT91
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F115234.115349
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jacm
>
rdfs:
label
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Donald_L._Miller
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Egon_Balas
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Joseph_F._Pekny
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Paolo_Toth
>
swrc:
number
4
(xsd:string)
swrc:
pages
985-1004
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jacm/BalasMPT91/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jacm/BalasMPT91
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jacm/jacm38.html#BalasMPT91
>
rdfs:
seeAlso
<
https://doi.org/10.1145/115234.115349
>
dc:
subject
assignment, matching, shortest augmenting paths, traveling salesman problem
(xsd:string)
dc:
title
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
38
(xsd:string)