<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Coleção:</title>
  <link rel="alternate" href="https://ri.ufs.br/jspui/handle/riufs/1706" />
  <subtitle />
  <id>https://ri.ufs.br/jspui/handle/riufs/1706</id>
  <updated>2026-05-04T12:40:37Z</updated>
  <dc:date>2026-05-04T12:40:37Z</dc:date>
  <entry>
    <title>Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number</title>
    <link rel="alternate" href="https://ri.ufs.br/jspui/handle/riufs/1707" />
    <author>
      <name>Piva, Breno</name>
    </author>
    <author>
      <name>Souza, Cid Carvalho de</name>
    </author>
    <id>https://ri.ufs.br/jspui/handle/riufs/1707</id>
    <updated>2016-03-17T05:00:12Z</updated>
    <published>2016-03-16T00:00:00Z</published>
    <summary type="text">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.</summary>
    <dc:date>2016-03-16T00:00:00Z</dc:date>
  </entry>
</feed>

