A separator theorem for intersecting objects in the plane

Nabil H. Mustafa, Rajiv Raman, Saurabh Ray

    Research output: Contribution to conferencePaper

    Abstract

    Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in the plane. In this paper we present a new separator theorem that unifies and generalizes some earlier results.

    Original languageEnglish (US)
    Pages380-385
    Number of pages6
    StatePublished - Jan 1 2014
    Event26th Canadian Conference on Computational Geometry, CCCG 2014 - Halifax, Canada
    Duration: Aug 11 2014Aug 13 2014

    Other

    Other26th Canadian Conference on Computational Geometry, CCCG 2014
    CountryCanada
    CityHalifax
    Period8/11/148/13/14

    Fingerprint

    Separator
    Separators
    Geometric object
    Theorem
    Design of Algorithms
    Intersection Graphs
    Approximation algorithms
    Approximation Algorithms
    Optimization Problem
    Generalise
    Object
    Graph in graph theory

    ASJC Scopus subject areas

    • Geometry and Topology
    • Computational Mathematics

    Cite this

    Mustafa, N. H., Raman, R., & Ray, S. (2014). A separator theorem for intersecting objects in the plane. 380-385. Paper presented at 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Canada.

    A separator theorem for intersecting objects in the plane. / Mustafa, Nabil H.; Raman, Rajiv; Ray, Saurabh.

    2014. 380-385 Paper presented at 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Canada.

    Research output: Contribution to conferencePaper

    Mustafa, NH, Raman, R & Ray, S 2014, 'A separator theorem for intersecting objects in the plane' Paper presented at 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Canada, 8/11/14 - 8/13/14, pp. 380-385.
    Mustafa NH, Raman R, Ray S. A separator theorem for intersecting objects in the plane. 2014. Paper presented at 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Canada.
    Mustafa, Nabil H. ; Raman, Rajiv ; Ray, Saurabh. / A separator theorem for intersecting objects in the plane. Paper presented at 26th Canadian Conference on Computational Geometry, CCCG 2014, Halifax, Canada.6 p.
    @conference{d0744cf80ef84b6bb454127afd4d65c7,
    title = "A separator theorem for intersecting objects in the plane",
    abstract = "Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in the plane. In this paper we present a new separator theorem that unifies and generalizes some earlier results.",
    author = "Mustafa, {Nabil H.} and Rajiv Raman and Saurabh Ray",
    year = "2014",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "380--385",
    note = "26th Canadian Conference on Computational Geometry, CCCG 2014 ; Conference date: 11-08-2014 Through 13-08-2014",

    }

    TY - CONF

    T1 - A separator theorem for intersecting objects in the plane

    AU - Mustafa, Nabil H.

    AU - Raman, Rajiv

    AU - Ray, Saurabh

    PY - 2014/1/1

    Y1 - 2014/1/1

    N2 - Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in the plane. In this paper we present a new separator theorem that unifies and generalizes some earlier results.

    AB - Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in the plane. In this paper we present a new separator theorem that unifies and generalizes some earlier results.

    UR - http://www.scopus.com/inward/record.url?scp=84961354977&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84961354977&partnerID=8YFLogxK

    M3 - Paper

    SP - 380

    EP - 385

    ER -