CSC373S Lecture 2 • Last time we ended by claiming that a greedy algorithm (lets call it EFT for earliest finishing time) that sorts intervals by their finishing times (ties can be broken arbitrarily) and then accepts “greedily” is an optimal algorithm for the interval selection - Call graph - Document - PDFSEARCH.IO

First Page	Meta Content
	CSC373S Lecture 2 • Last time we ended by claiming that a greedy algorithm (lets call it EFT for earliest finishing time) that sorts intervals by their finishing times (ties can be broken arbitrarily) and then accepts “greedily” is an optimal algorithm for the interval selection Add to Reading List Document Date: 2011-01-20 08:49:33 Open Document File Size: 36,21 KB Share Result on Facebook Company See / / IndustryTerm greedy solution / non optimal greedy algorithms / deterministic polynomial time algorithm / greedy style algorithms / allowable solution / greedy algorithm / non optimal algorithms / arbitrary solution / greedy algorithms / / Person Job Interval / / Technology greedy algorithm / same algorithm / greedy EFT algorithm / EFT greedy algorithm / greedy style algorithms / 2-approximation algorithm / FPTAS algorithms / deterministic polynomial time algorithm / / SocialTag Analysis of algorithms Charging argument Scheduling algorithms Operations research Graph coloring Interval scheduling NP-complete problems Greedy algorithm Algorithm Mathematics