sxlxc/ijcai25-slides-poster
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 1 Wiki Activity

update action & fix typo
Some checks failed
build pdf / build (push) Failing after 1s
Details

Browse Source
This commit is contained in:
Yu Cong
2025-08-22 10:29:54 +08:00
parent 1361b5fac1
commit 0ddd930119
3 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
slides.tex
View File

@@ -47,7 +47,7 @@ A ride sharing company wants to send riders promotional coupons in the hope of m
\begin{frame}{Multiple-choice knapsack}
\textbf{Input}: $n$ sets of coupons $K_1,\dots,K_n$. Each coupon $e\in K_i$ has a non-negative cost $c_e\in \Z_+$ and value $v_e\in \Z_+$. A positive budget $b\in \Z_+$.
\textbf{Output}: A (multi)set of coupons $K$ that maximizes the total value $\sum_{e\in K} c_e$ while satisfying \textcolor{Red}{$|K\cap K_i|\leq 1$} and $\sum_{e\in K} c_e\leq b$.
\textbf{Output}: A subset of coupons $K$ that maximizes the total value $\sum_{e\in K} c_e$ while satisfying \textcolor{Red}{$|K\cap K_i|\leq 1$} and $\sum_{e\in K} c_e\leq b$.
\vspace{1em}
\pause