[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/amai/SaridS08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Amir_Shapiro>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Shahar_Sarid>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2Fs10472-009-9122-0>
foaf:homepage <https://doi.org/10.1007/s10472-009-9122-0>
dc:identifier DBLP journals/amai/SaridS08 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2Fs10472-009-9122-0 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/amai>
rdfs:label Classifying the multi robot path finding problem into a quadratic competitive complexity class. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Amir_Shapiro>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Shahar_Sarid>
swrc:number 2-4 (xsd:string)
swrc:pages 169-203 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/amai/SaridS08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/amai/SaridS08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/amai/amai52.html#SaridS08>
rdfs:seeAlso <https://doi.org/10.1007/s10472-009-9122-0>
dc:subject Mathematics Subject Classifications (2000) 68Q25; 68Q15; 68Q17; 68W15; 68W40; 68T40; 11Y16; 93C85 (xsd:string)
dc:title Classifying the multi robot path finding problem into a quadratic competitive complexity class. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 52 (xsd:string)