About this document

Efficient Dominating Set Algorithm by Kshitij Jaiswal is a document available to read on EtoBox.

This document describes a programming assignment to find the dominating set of points in 2D space. The problem asks to write a C program that takes a set of n points as input, and outputs the dominating set of those points using a divide and conquer algorithm with O(n log n) time complexity. It provides hints on using a subroutine Dom(i, j) to find the dominating set within a subset of points, and initially sorting the points by x-value. Sample input and output are given along with constraints on the input

Author

Kshitij Jaiswal

Language

EN