Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number

Please use this identifier to cite or link to this item: https://ri.ufs.br/jspui/handle/riufs/1707

Full metadata record

DC Field	Value	Language
dc.contributor.author	Piva, Breno	-
dc.contributor.author	Souza, Cid Carvalho de	-
dc.date.accessioned	2016-03-16T21:17:36Z	-
dc.date.available	2016-03-16T21:17:36Z	-
dc.date.issued	2016-03-16	-
dc.identifier.uri	https://ri.ufs.br/handle/riufs/1707	-
dc.description.abstract	This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number.	pt_BR
dc.language.iso	en	pt_BR
dc.subject	Partição retangular	pt_BR
dc.subject	Polígonos retilineos	pt_BR
dc.subject	Número de stabbing mínimo	pt_BR
dc.title	Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number	pt_BR
dc.type	Artigo	pt_BR
dc.identifier.license	Direitos autorais pertencentes ao(s) autor(es)	pt_BR
Appears in Collections:	DCOMP - Outras produções bibliográficas

Files in This Item:

File	Description	Size	Format
Counterexample2-approximation.pdf		121.36 kB	Adobe PDF	View/Open