This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Introduction to Algorithms December 6, 2003 Massachusetts Institute of Technology 6.046J/18.410J Professors Shafi Goldwasser and Silvio Micali Handout 30 Problem Set 9 This problem set is not to be handed in. Reading: Chapters 34, 35. Problem 9-1. The challenges of industrial research We say that a graph has a spanning graph of degree if there exists a subset of edges such that (1) is a connected graph and (2) the degree of each vertex in is at most . Such a is called a degree spanning graph of . This problem has practical applications for telecommunications networks where nodes have bounded degrees. You are working as an algorithms designer for a major telecommunications company. A co-worker of yours has been working on developing an efficient algorithm for the following search problem, SEARCH-SG: given a graph and an integer , find a subset of edges such that is a degree spanning graph of , if one exists. One day this co-worker leaves the company for a start-up, and the management asks you to take over his project where he has left off. It turns out that all he has been able to do so far is to design a magic box DECISION-SG that solves the following decision problem: on input a graph...
View Full Document
This note was uploaded on 01/01/2011 for the course CS 5503 taught by Professor Charlese.leiserson during the Fall '01 term at MIT.
- Fall '01