IIIT-Delhi Institutional Repository

Browsing by Author "Das, Syamantak (Advisor)"

Browsing by Author "Das, Syamantak (Advisor)"

Sort by: Order: Results:

  • Algoizer app 
    Porvil; Aslam, Zubair; Bera, Debajyoti (Advisor); Das, Syamantak (Advisor) (IIIT- Delhi, 2021-05)
    This B.Tech. Project focuses on the visualization of Data Structures and Algorithms. An android application has been developed to help students understand step by step working of different data structures and algorithms.
  • A combinatorial algorithm for fault tolerant k-median clustering on a line metric 
    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 ...
  • Community detection in networks 
    Agrawal, Chaitanya; Das, Syamantak (Advisor); Chakraborty, Tanmoy (Advisor) (IIIT-Delhi, 2019-11-15)
    We are trying to devise a community detection algorithm for networks through modularity maximization. In this semester we further studied and understood the modularity function. We have explored semi-supervised active ...
  • A deadline-aware scheduler for smart factory using wifi 6 
    Mishra, Anis; Bhattacharya, Arani (Advisor); Maity, Mukulika (Advisor); Das, Syamantak (Advisor) (IIIT-Delhi, 2023-12-09)
    We discuss the optimization of wireless network scheduling in smart factories, specifically focusing on data packets with varying deadlines and importance levels. The proposed solution involves utilizing IEEE 802.11ax (WiFi ...
  • K-center problems 
    Ahuja, Yajur; Das, Syamantak (Advisor) (IIIT-DElhi, 2020-06-03)
    We consider a generalization of the classical K-center problem with capacities, demands, and outliers. The capacitated K-center problem adds a constraint to the original K-center problem of every vertex having a capacity ...
  • Multiprocessor scheduling with rejections: theory and practice 
    Gehlot, Gaurav; Das, Syamantak (Advisor) (IIITD-Delhi, 2019-04-25)
    We consider the classical on-line load balancing problem of temporary tasks under restricted assignments. Each job can be processed only on a subset of machines, different jobs require a different amounts of processing ...
  • Online bipartite matching 
    Aggarwal, Aayush; Das, Syamantak (Advisor) (IIIT Delhi, 2020-06-06)
    We are given a bipartite graph G(R, S, E) (|R| = |S|), where R denotes the set of requests and S being the set of servers. The requests R (given by an adversary) arrive sequentially along with their distances to each of ...
  • Online list update problem 
    Arora, Shivoy; Das, Syamantak (Advisor) (IIIT-Delhi, 2023-11-29)
    This thesis explores the dynamics of online algorithms, with a focus on the List Update Problem in online optimization. Our study revolves around the analysis of various algorithmic strategies, under the frameworks of ...
  • Online metric matching in euclidean norm 
    Marwah, Ishaan; Seth, Ritesh; Das, Syamantak (Advisor) (IIIT-Delhi, 2023-11-29)
    This report addresses the problem of online metric matching. In this scenario, a group of servers is situated within a metric space, and requests continuously arrive over time in an unpredictable manner. The objective is ...

Search Repository

Browse

My Account