Minimizing Maximum Movement to Attain Connectivity.

Date of Submission

December 2014

Date of Award

Winter 12-12-2015

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science

Department

Advance Computing and Microelectronics Unit (ACMU-Kolkata)

Supervisor

Das, Sandip (ACMU-Kolkata; ISI)

Abstract (Summary of the Work)

Given n discs of same radius in R2 , we study the problem of moving the discs to form a connected configuration such that the maximum moving distance of the discs is minimized. It appears to us that it is a difficult problem. Three discs and four discs examples were seen. We put the discs in a line and connect them with the same objective. The disc here could be any object or pebble. The pebbles are placed in the vertices of a tree and the movement is allowed only along the edges of a tree. Here also we need to move the pebbles to get them in a connected configuration. In general, this work investigates the movement problems; primarily focussing on minimizing the maximum movement. This will help determine the amount of battery life required by the devices to come to a connected state to impart some information.

Comments

ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843246

Control Number

ISI-DISS-2014-274

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

DOI

http://dspace.isical.ac.in:8080/jspui/handle/10263/6430

This document is currently not available here.

Share

COinS