Browsing Computer Science and Automation (CSA) by Advisor "Govindarajan, Sathish"
Now showing items 16 of 6

Approximation Algorithms for Geometric Packing and Covering Problems
We study a host of geometric optimization problems that are NPhard and design polynomial time approximation algorithms for them. More precisely, we are given a family of geometric objects and a point set, mostly in the ... 
Delaunay Graphs for Various Geometric Objects
(20171212)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 ... 
Hitting Geometric Range Spaces using a Few Points
(20180215)A range space (P, S) consists of a set P of n elements and a collection S = {S1,...,Sm} of subsets of P , referred to as ranges. A hitting set for this range space refers to a subset H of P such that every Si in S contains ... 
Two Player Game Variant Of The Erdos Szekeres Problem
(20140801)The following problem has been known for its beauty and elementary character. The Erd˝os Szekeres problem[7]: For any integer k ≥ 3, determine if there exists a smallest positive integer N(k) such that any set of atleast ... 
Variants and Generalization of Some Classical Problems in Combinatorial Geometry
(20180218)In this thesis we consider extensions and generalizations of some classical problems in Combinatorial Geometry. Our work is an offshoot of four classical problems in Combinatorial Geometry. A fundamental assumption in these ...