Browsing Computer Science and Automation (CSA) by Subject "Hitting Set"

Now showing items 1-2 of 2

    • Delaunay Graphs for Various Geometric Objects 

      Agrawal, Akanksha (2017-12-12)
      Given a set of n points P ⊂ R2, the Delaunay graph of P for a family of geometric objects C is a graph defined as follows: the vertex set is P and two points p, p' ∈ P are connected by an edge if and only if there exists ...

    • Generalization of Hitting, Covering and Packing Problems on Intervals 

      Datta Krupa, R (2018-05-29)
      Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting ...