IIIT-Delhi Institutional Repository

Browsing by Author "Raman, Rajiv (Advisor)"

Browsing by Author "Raman, Rajiv (Advisor)"

Sort by: Order: Results:

  • Anderson, Nihesh; Arora, Kushagra; Raman, Rajiv (Advisor); Das, Syamantak (Advisor) (IIITD-Delhi, 2019-04-15)
    Given a metric space X, a set of clients C X, and a set of facilities F X, such that X = F S C. the fault-tolerant k-median problem (FTM) requires to open k facilities in F so as to minimize the sum of distances from each ...
  • Mahajan, Sahil; Raman, Rajiv (Advisor) (2016-09-13)
    In guillotine cut problem, we are given non-intersecting convex sets in the plane and we are allowed straight line cuts. If a cut passes through an object, it kills that object. Can one always save a constant fraction or ...
  • Jain, Siddhartha; Raman, Rajiv (Advisor); Ram, Samrith (Advisor) (IIITD-Delhi, 2019-04-15)
    Given a set of axis-parallel rectangles on a plane, can you cut out a constant fraction of them using only Guillotine cuts? We try to answer this question in the project. The general problem of cutting out convex sets was ...
  • Khan, Akif Ahmed; Raman, Rajiv (Advisor); Bera, Debajyoti (Advisor); Sharma, Ojaswa (Advisor) (2015-12-03)
    Range Tree is a geometrical data structure used to store data in d-dimensions. In order to store larger amount of data in external memory, we need an I/O efficient algorithm. There are many I/O efficient algorithms ...

Search Repository


My Account