BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Helsinki Institute for Information Technology | HIIT - ECPv4.8.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Helsinki Institute for Information Technology | HIIT
X-ORIGINAL-URL:https://www.hiit.fi
X-WR-CALDESC:Events for Helsinki Institute for Information Technology | HIIT
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20180927T160000
DTEND;TZID=Europe/Helsinki:20180927T170000
DTSTAMP:20190823T084728
CREATED:20180919T104207Z
LAST-MODIFIED:20180927T111209Z
UID:5447-1538064000-1538067600@www.hiit.fi
SUMMARY:Helsinki Algorithms Seminar: Joachim Spoerhase "Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity"
DESCRIPTION:Weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design.\nDate: Thursday 27.9.2018 at 16:00-17:00Venue: Exactum C122\, Gustaf Hällströmin katu 2 B\, Kumpula \nSpeaker: Joachim Spoerhase \nTitle: Stabbing Rectangles by Line Segments – How Decomposition Reduces the Shallow-Cell Complexity \nAbstract: \nWe initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizontal line segments of minimum total length so that every rectangle is stabbed by some line segment. A line segment stabs a rectangle if it intersects its left and its right boundary. The problem\, which we call Stabbing\, can be motivated by a resource allocation problem and has applications in geometric network design. To the best of our knowledge\, only special cases of this problem have been considered so far. Stabbing is a weighted geometric set cover problem\, which we show to be NP-hard. A constrained variant of Stabbing turns out to be even APX-hard. While for general set cover the best possible approximation ratio is Θ(log n)\, it is an important field in geometric approximation algorithms to obtain better ratios for geometric set cover problems. Chan et al. [SODA’12] generalize earlier results by Varadarajan [STOC’10] to obtain sub-logarithmic performances for a broad class of weighted geometric set cover instances that are characterized by having low shallow-cell complexity. The shallow-cell complexity of Stabbing instances\, however\, can be high so that a direct application of the framework of Chan et al. gives only logarithmic bounds. We still achieve a constant-factor approximation by decomposing general instances into what we call laminar instances that have low enough complexity. \nOur decomposition technique yields constant-factor approximations also for the variant where rectangles can be stabbed by horizontal and vertical segments and for two further geometric set cover problems. \n** \nHelsinki Algorithms Seminar is a weekly meeting of researchers in the Helsinki area interested in the art of algorithms and algorithm design\, broadly interpreted to cover both theoretical ideas and algorithm engineering on concrete computing platforms. In most cases we have a presentation prepared for each meeting to communicate an idea\, a recent result\, work-in-progress\, or demo\, but this should not be at the expense of discussion and simply having fun with algorithms. \nOur affiliations are with Aalto University and the University of Helsinki\, and accordingly our activities alternate between the Otaniemi Campus of Aalto University and the Kumpula Campus of University of Helsinki\, catalyzed by the Helsinki Institute for Information Technology HIIT\, under the Algorithmic Data Analysis (ADA) programme. \nFor the season programme\, please see the seminar webpage. \n
URL:https://www.hiit.fi/event/helsinki-algorithms-seminar-joachim-spoerhase-stabbing-rectangles-by-line-segments-how-decomposition-reduces-the-shallow-cell-complexity/
END:VEVENT
END:VCALENDAR