[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/wads/HassanzadehR09>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/David_Rappaport>
dc:creator <http://dblp.l3s.de/d2r/resource/authors/Farzad_Hassanzadeh>
foaf:homepage <http://dx.doi.org/10.1007%2F978-3-642-03367-4%5F32>
foaf:homepage <http://dx.doi.org/10.1007/978-3-642-03367-4_32>
dc:identifier DBLP conf/wads/HassanzadehR09 (xsd:string)
dc:identifier DOI 10.1007%2F978-3-642-03367-4%5F32 (xsd:string)
dcterms:issued 2009 (xsd:gYear)
rdfs:label Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. (xsd:string)
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/David_Rappaport>
foaf:maker <http://dblp.l3s.de/d2r/resource/authors/Farzad_Hassanzadeh>
swrc:pages 363-374 (xsd:string)
dcterms:partOf <http://dblp.l3s.de/d2r/resource/publications/conf/wads/2009>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/wads/HassanzadehR09/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/wads/HassanzadehR09>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/wads/wads2009.html#HassanzadehR09>
rdfs:seeAlso <http://dx.doi.org/10.1007/978-3-642-03367-4_32>
swrc:series <http://dblp.l3s.de/d2r/resource/conferences/wads>
dc:subject Computational Geometry; Line Segment; Intersecting Polygon; Approximation Algorithm (xsd:string)
dc:title Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document