<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Coleção:</title>
    <link>https://ri.ufs.br/jspui/handle/riufs/1706</link>
    <description />
    <pubDate>Mon, 04 May 2026 09:13:57 GMT</pubDate>
    <dc:date>2026-05-04T09:13:57Z</dc:date>
    <item>
      <title>Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number</title>
      <link>https://ri.ufs.br/jspui/handle/riufs/1707</link>
      <description>Título: Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number
Autor(es): Piva, Breno; Souza, Cid Carvalho de
Abstract: This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem&#xD;
of finding a rectangular partition of a rectilinear polygon with minimum&#xD;
stabbing number.</description>
      <pubDate>Wed, 16 Mar 2016 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://ri.ufs.br/jspui/handle/riufs/1707</guid>
      <dc:date>2016-03-16T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

