bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Small fixes

This commit is contained in:
Antti H S Laaksonen 2017-05-25 23:18:49 +03:00
parent a816a04d3a
commit 43312caa92
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
chapter06.tex
View File

@ -28,7 +28,7 @@ where we are given a set of coins
and our task is to form a sum of money $n$ and our task is to form a sum of money $n$
using the coins. using the coins.
The values of the coins are The values of the coins are
$\{c_1,c_2,\ldots,c_k\}$, $\texttt{coins}=\{c_1,c_2,\ldots,c_k\}$,
and each coin can be used as many times we want. and each coin can be used as many times we want.
What is the minimum number of coins needed? What is the minimum number of coins needed?
@ -120,7 +120,7 @@ Many scheduling problems can be solved
using greedy algorithms. using greedy algorithms.
A classic problem is as follows: A classic problem is as follows:
Given $n$ events with their starting and ending Given $n$ events with their starting and ending
times, our goal is to plan a schedule times, find a schedule
that includes as many events as possible. that includes as many events as possible.
It is not possible to select an event partially. It is not possible to select an event partially.
For example, consider the following events: For example, consider the following events: