# Inbox Intake Index

Bang nay ghi ket qua doc nhanh phan dau cua cac file hien co trong `inbox/`.

## Current Files

| File | Identified title / topic | Provisional primary group | Notes |
| --- | --- | --- | --- |
| `AN ANALYSIS OF APPROXIMATIONS FOR.pdf` | *An Analysis of Approximations for Maximizing Submodular Set Functions - I* | `submodular` | Foundational original. Classic paper cua Nemhauser-Wolsey-Fisher ve greedy/local improvement cho maximization duoi cardinality-like settings. |
| `1. SMK23.pdf` | *Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint* | `submodular` | IJCAI 2023 paper ve linear-query deterministic / randomized algorithms cho non-monotone knapsack. |
| `1309.5469v1.pdf` | *Towards Minimizing k-Submodular Functions* | `k-submodular` | Foundational structural paper cho k-submodular minimization; proves a Min-Max theorem, defines a k-submodular polyhedron, and leaves oracle-model polynomial-time minimization open. |
| `1310.1771v1.pdf` | *Potts model, parametric maxflow and k-submodular functions* | `k-submodular` | Structural Potts / vision paper noi Kovtun preprocessing, parametric maxflow, va natural `k`-submodular relaxations voi persistency. |
| `1502.07406v1.pdf` | *Improved Approximation Algorithms for k-Submodular Function Maximization* | `k-submodular` | Foundational maximization paper dat `1/2` cho unconstrained va `k / (2k - 1)` cho monotone, kem hardness asymptotic tight. |
| `1504.07830v3.pdf` | *On k-Submodular Relaxation* | `k-submodular` | Characterizes when a multilabel objective admits a `k`-submodular relaxation via closure under `theta`, and gives an `O((kn)^2)` construction algorithm. |
| `1607.07957v3.pdf` | *On maximizing a monotone k-submodular function subject to a matroid constraint* | `k-submodular` | Greedy `1/2`-approximation cho monotone matroid-constrained line. |
| `1610.00151v2.pdf` | *A compact representation for minimizers of k-submodular functions* | `k-submodular` | PIP / median-semilattice representation cho tap minimizers, kem Potts-specific enumeration of maximal minimizers. |
| `1610.07729v2.pdf` | *Derandomization for k-submodular maximization* | `k-submodular` | Derandomize baseline monotone `k / (2k - 1)` bang distribution-support LP update. |
| `1807.04965v1.pdf` | *No-regret algorithms for online k-submodular maximization* | `k-submodular` | Mo nhanh online-learning branch qua Blackwell approachability va `O(nk sqrt(T))` approximate regret. |
| `1907.06173v1.pdf` | *The Fast Algorithm for Submodular Maximization* | `submodular` | Practical low-adaptivity / parallel cardinality paper `FAST`, nhan manh small constants va runtime thuc te. |
| `1907.12942v1 (1).pdf` | *Improved Randomized Algorithm for k-Submodular Function Maximization* | `k-submodular` | Duplicate copy cua `1907.12942v1.pdf`; khong tao canonical moi. |
| `1907.12942v1.pdf` | *Improved Randomized Algorithm for k-Submodular Function Maximization* | `k-submodular` | arXiv preprint cua paper journal SIAM DM 2021; unconstrained non-monotone line, cai thien randomized ratio vuot `1/2`. |
| `2006.15744v1.pdf` | *Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints* | `k-submodular` | arXiv 2020 paper mo nhanh privacy / sensitive-data branch: private `(1 - 1 / e)` cho monotone submodular matroid va private `1/2` cho monotone k-submodular matroid. |
| `2009.01947v5.pdf` | *Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint* | `submodular` | arXiv 2020 paper cho low-adaptivity non-monotone cardinality; sua bug threshold-sampling cua conference version bang `ThreshSeq` va dat `1/6 - epsilon` / `0.193 - epsilon`. |
| `2. k-sub.pdf` | *Maximizing a k-Submodular Maximization Function under an Individual Knapsack Constraint* | `k-submodular` | SoICT 2023 conference paper mo nhanh individual-knapsack cho k-submodular streaming; khong phai duplicate cua `k-sub.pdf`. |
| `2101.07157v1.pdf` | *Maximizing Approximately k-Submodular Functions* | `k-submodular` | arXiv 2021 paper dinh nghia `eps`-approximately `k`-submodular / `eps`-ADR va dua ra greedy ratios duoi total-size / individual-size constraints. |
| `2105.15159v2.pdf` | *Corrigendum to "On Maximizing a Monotone k-Submodular Function under a Knapsack Constraint"* | `k-submodular` | Corrigendum cho ORL line monotone knapsack; giu nguyen algorithm size-two-seed + density-greedy nhung sua proof va nang ratio len `0.4`. |
| `2107.07103v3.pdf` | *On Optimal Approximations for k-Submodular Maximization via Multilinear Extension* | `k-submodular` | arXiv paper cho multilinear-extension / Frank-Wolfe line, dat `1/2 - epsilon` monotone va `1/3 - epsilon` non-monotone cho single matroid hay `O(1)` knapsacks. |
| `2109.08863v2.pdf` | *Streaming algorithms for Budgeted k-Submodular Maximization problem* | `k-submodular` | Preprint / alternate version cua budgeted-streaming line da co canonical folder; khong tao paper moi, chi map duplicate ve paper journal / canonical hien co. |
| `2111.07217v1.pdf` | *Cardinality constrained submodular maximization for random streams* | `submodular` | arXiv 2021 paper random-order streaming, dat `1 - 1/e - epsilon` cho monotone va `1/e - epsilon` cho non-monotone voi `O(k / epsilon)` memory, kem hardness barrier. |
| `2111.07917v3.pdf` | *Optimal Submodular Maximization in Parallel* | `submodular` | arXiv 2021 paper cho `LINEAR SEQ`, `THRESHOLD SEQ`, va `LS+PGB`, dat gan-toi-uu cho monotone cardinality trong parallel linear-query regime. |
| `2305.16013v1.pdf` | *Online and Streaming Algorithms for Constrained k-Submodular Maximization* | `k-submodular` | arXiv preprint da len AAAI 2025; framework rong cho cardinality, partition-matroid, va knapsack constraints trong che do online/streaming. |
| `2306.14520v3.pdf` | *Approximation algorithms for k-submodular maximization subject to a knapsack constraint* | `k-submodular` | arXiv 2023 paper day common-cost single-knapsack line len `0.432` monotone va mo nhanh non-monotone combinatorial `0.317`. |
| `2307.13996v1.pdf` | *Fast algorithms for k-submodular maximization subject to a matroid constraint* | `k-submodular` | arXiv 2023 paper ve threshold-decreasing duoi matroid; giu ratios `(1/2 - epsilon)` va `(1/3 - epsilon)` nhung bo duoc phu thuoc tuyen tinh vao rank. |
| `2312.03593v1.pdf` | *Streaming Algorithms for the k-Submodular Cover Problem* | `k-submodular` | arXiv 2023 paper mo nhanh weighted k-submodular cover trong streaming / bicriteria model, voi bien the known-optimum, 2-pass, va 1-pass. |
| `2405.05202v3.pdf` | *Discretely Beyond 1/e: Guided Combinatorial Algorithms for Submodular Maximization* | `submodular` | arXiv 2024 paper dat cac moc combinatorial beyond-`1/e` cho size va matroid bang local-search guidance + guided greedy. |
| `2405.13994v1.pdf` | *Practical 0.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint* | `submodular` | arXiv 2024 paper practical cho non-monotone cardinality, dat `0.385` voi query complexity `O(n + k^2)`. |
| `2406.00148v2.pdf` | *Submodular Maximization in Exactly n Queries* | `submodular` | arXiv 2024 paper ve deterministic linear-query algorithms cho matroid-constrained submodular maximization; monotone case dat `1/4` bang dung `n` queries, general case dat constant factor bang `2n` queries. Da co canonical folder va processed-deep. |
| `2411.05318v1.pdf` | *Fairness in Monotone k-submodular Maximization: Algorithms and Applications* | `k-submodular` | arXiv 2024 paper fairness dau tien trong repo cho k-submodular: exact lower / upper quotas duoi total budget, `1/3` greedy va `(1/3 - epsilon)` threshold. |
| `2502.07062v2.pdf` | *Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and 1/e Approximation* | `submodular` | arXiv 2025 paper dat moc parallel combinatorial `1/e - epsilon` duoi size constraint voi logarithmic adaptivity. |
| `2507.12875v1.pdf` | *A 1/2-Approximation for Budgeted k-Submodular Maximization* | `k-submodular` | arXiv 2025 paper cua Chenhao Wang; giai quyet open question ve `1/2` monotone total-budget k-submodular knapsack bang `1-Guess Greedy`, dong thoi dat `1/3` cho non-monotone va dua ra mot continuous transformation proof qua `k`-multilinear extension. |
| `3. SMC.pdf` | *Improved Streaming Algorithm for Minimum Cost Submodular Cover Problem* | `submodular` | Streaming / bicriteria paper cho minimum-cost submodular cover. |
| `4. SMK24.pdf` | *Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint* | `submodular` | IJCAI 2024 paper ve low-adaptivity / parallel non-monotone knapsack. |
| `4836_Unconstrained_Submodular_.pdf` | *Unconstrained Submodular Maximization in Dynamic Setting* | `submodular` | Anonymous ICML 2026 reviewer copy; dynamic unconstrained non-monotone USM, pha moc `0.25` voi amortized `O(sqrt(n))` queries trong incremental / decremental, va dua them fully dynamic bien the co deletion-time predictions. |
| `5. k-sub apjor.pdf` | *k-Submodular Maximization Under Individual Knapsack Constraints: Applications and Streaming Algorithm* | `k-submodular` | APJOR 2025 journal version mo rong nhanh individual-knapsack; lien quan nhung khong trung voi SoICT 2023. |
| `6. DrSubmodular.pdf` | *Fast Approximation Algorithm for Non-monotone DR-submodular Maximization under Size Constraint* | `dr-submodular` | Journal paper ve deterministic near-linear-time algorithms cho non-monotone DR-submodular under size constraint. |
| `badanidiyuru14streaming.pdf` | *Streaming Submodular Maximization: Massive Data Summarization on the Fly* | `submodular` | Streaming maximization duoi cardinality; paper rat cot loi cho huong large-scale / one-pass. |
| `dr-sub.pdf` | *A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice* | `dr-submodular` | Huong integer lattice / DR-style generalization; gan voi cover problem hon la survey tong quan. |
| `duetting24a.pdf` | *Consistent Submodular Maximization* | `submodular` | ICML 2024 paper ve monotone submodular maximization duoi cardinality trong dynamic insertion setting voi rang buoc consistency / stability giua cac loi giai lien tiep. Da co canonical folder va processed-deep. |
| `ene22a.pdf` | *Streaming Algorithm for Monotone k-Submodular Maximization with Cardinality Constraints* | `k-submodular` | ICML 2022 paper ve primal-dual single-pass cho per-coordinate cardinality; cung hop cho online free disposal. |
| `IEEE_DSAA22_Final_tantd.zip` | *Fast Streaming Algorithms for k-Submodular Maximization under a Knapsack Constraint* | `k-submodular` | Source package (TeX + figures). Da duoc dua vao canonical folder va processed-deep; paper streaming / knapsack query-efficient cho monotone k-submodular maximization. |
| `k-sub.pdf` | *Maximizing Bisubmodular and k-Submodular Functions* | `k-submodular` | Paper nen tang cho k-submodular maximization trong value oracle model. |
| `k_sub_matroid_ijcai26.pdf` | *Fairness k-submodular maximization subject to matroid constraint* | `k-submodular` | Draft / review-style PDF khong hien authors; mo rong fairness sang matroid va non-monotone objectives, nhung lower bounds chi dat o muc xap xi `floor(l_i / 2)`. |
| `Maximizing-k-submodular-functions-under-budget-constraint-applications-and-streaming-algorithms.pdf` | *Maximizing k-Submodular Functions under Budget Constraint: Applications and Streaming Algorithms* | `k-submodular` | JCO 2022 journal paper ve budgeted / total-budget k-submodular streaming, xu ly ca cost chung va cost phu thuoc label. |
| `min-sub.pdf` | *Submodular function minimization* (Iwata survey) | `submodular` | Survey ve SFM, phu hop lam note tong quan cho minimization. |
| `minimizie sub.pdf` | *A combinatorial algorithm minimizing submodular functions in strongly polynomial time* | `submodular` | Paper co tinh thuat toan co dien cho SFM; nen gan voi minimization/combinatorial algorithms. |
| `nie23a.pdf` | *Size-Constrained k-Submodular Maximization in Near-Linear Time* | `k-submodular` | UAI 2023 paper ve threshold-greedy near-linear cho total-size va individual-size constraints. |
| `nie23a-supp.pdf` | Supplementary material for *Size-Constrained k-Submodular Maximization in Near-Linear Time* | `k-submodular` | Appendix proof cho paper UAI 2023 tren, khong phai canonical paper rieng. |
| `NIPS-2013-submodular-optimization-with-submodular-cover-and-submodular-knapsack-constraints-Paper.pdf` | *Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints* | `submodular` | Cover + knapsack constraints, giua maximization/minimization constrained submodular optimization. |
| `On_submodular_function_minimization.pdf` | *On submodular function minimization* / SFM survey material | `submodular` | File nay co ve la survey/handbook material, khong giong paper goc nghien cuu moi. |
| `9658_A_General_Framework_for_D.pdf` | *A General Framework for Dynamic Consistent Submodular Maximization* | `submodular` | Anonymous ICML 2026 reviewer copy; framework fully dynamic cho consistency-aware submodular maximization, instantiate cho cardinality va matroid bang transition windows va deletion-robust routines. |
| `sub-modular.pdf` | *An Analysis of Approximations for Maximizing Submodular Set Functions - I* | `submodular` | Co ve la ban scan/trung voi `AN ANALYSIS OF APPROXIMATIONS FOR.pdf`. |
| `submodular survey.pdf` | *Submodular Optimization Problems and Greedy Strategies: A Survey* | `submodular` | Survey hien dai ve greedy, curvature, batched greedy, string submodularity. |
| `submodular-cover.pdf` | *Generalized Submodular Cover Problems and Applications* | `submodular` | Cover-oriented, mang tinh approximation/classical theory. |
| `submodular-functions-matroids-and-certain-polyhedra-53q1tge8w1.pdf` | *Submodular Functions, Matroids, and Certain Polyhedra* | `submodular` | Foundational original. Edmonds classic; rat quan trong cho concepts/polymatroid/matroid foundations. |
| `submodular.pdf` | *Submodular Optimization Problems and Greedy Strategies: A Survey* | `submodular` | Co ve trung voi `submodular survey.pdf`. |
| `wz14soda-preprint.pdf` | *Maximizing Bisubmodular and k-Submodular Functions* | `k-submodular` | Co ve la preprint / duplicate cua `k-sub.pdf`, cung paper Ward-Zivny 2014 ve oracle-model k-submodular maximization. |

## Immediate Observations

- Hai file goc quan trong nhat hien tai la:
  - `AN ANALYSIS OF APPROXIMATIONS FOR.pdf`
  - `submodular-functions-matroids-and-certain-polyhedra-53q1tge8w1.pdf`
- `submodular survey.pdf` va `submodular.pdf` co ve la cung mot survey.
- `AN ANALYSIS OF APPROXIMATIONS FOR.pdf` va `sub-modular.pdf` co ve la cung mot classic paper cua Nemhauser-Wolsey-Fisher.
- `wz14soda-preprint.pdf` va `k-sub.pdf` co ve la hai ban cua cung mot paper Ward-Zivny 2014.
- `1309.5469v1.pdf` bo sung mot tru `k-submodular` minimization / polyhedral line, bo doi voi nhanh maximization cua Ward-Zivny.
- Hien tai `inbox/` nghieng manh ve `submodular`; nhung cum `k-submodular` da co ca foundation maximization, structural minimization, va constrained streaming / knapsack.
- Cum file moi cho thay repo dang mo rong manh theo 3 huong:
  - non-monotone submodular knapsack nhanh / song song
  - k-submodular voi individual knapsack constraints
  - DR-submodular non-monotone tren integer lattice
- Cac file moi nhat mo them hai huong submodular khac:
  - query-efficient matroid-constrained maximization (`2406.00148v2.pdf`)
  - dynamic / stable / consistency-aware cardinality maximization (`duetting24a.pdf`)
- Cum file moi vua dua vao repo mo them them ba nhanh:
  - `k`-submodular matroid thresholding (`2307.13996v1.pdf`)
  - fairness `k`-submodular duoi total budget va duoi matroid (`2411.05318v1.pdf`, `k_sub_matroid_ijcai26.pdf`)
  - non-monotone submodular beyond-`1/e` theo hai huong practical va parallel (`2405.05202v3.pdf`, `2405.13994v1.pdf`, `2502.07062v2.pdf`)
- Co 2 cum rat ro de trich note som:
  - nen tang co dien: Edmonds, Nemhauser-Wolsey-Fisher, SFM surveys
  - huong mo rong: streaming, k-submodular, DR-submodular cover

## Canonical Folder Mapping

- `AN ANALYSIS OF APPROXIMATIONS FOR.pdf`
  -> `papers/submodular/1978-nemhauser-wolsey-fisher-maximizing-submodular-set-functions/`
- `1. SMK23.pdf`
  -> `papers/submodular/2023-pham-et-al-linear-query-nonmonotone-knapsack/`
- `1309.5469v1.pdf`
  -> `papers/k-submodular/2013-huber-kolmogorov-towards-minimizing-k-submodular-functions/`
- `1310.1771v1.pdf`
  -> `papers/k-submodular/2013-gridchyn-kolmogorov-potts-parametric-maxflow-k-submodular/`
- `1502.07406v1.pdf`
  -> `papers/k-submodular/2015-iwata-tanigawa-yoshida-improved-k-submodular-maximization/`
- `1504.07830v3.pdf`
  -> `papers/k-submodular/2016-hirai-iwamasa-k-submodular-relaxation/`
- `1607.07957v3.pdf`
  -> `papers/k-submodular/2016-sakaue-monotone-k-submodular-matroid-constraint/`
- `1610.00151v2.pdf`
  -> `papers/k-submodular/2017-hirai-oki-pip-representation-k-submodular-minimizers/`
- `1610.07729v2.pdf`
  -> `papers/k-submodular/2017-oshima-derandomization-k-submodular-maximization/`
- `1807.04965v1.pdf`
  -> `papers/k-submodular/2018-soma-online-k-submodular-maximization/`
- `1907.06173v1.pdf`
  -> `papers/submodular/2019-breuer-balkanski-singer-fast-algorithm-submodular-maximization/`
- `1907.12942v1 (1).pdf`
  -> duplicate of `papers/k-submodular/2021-oshima-improved-randomized-k-submodular-maximization/`
- `1907.12942v1.pdf`
  -> `papers/k-submodular/2021-oshima-improved-randomized-k-submodular-maximization/`
- `2006.15744v1.pdf`
  -> `papers/k-submodular/2020-rafiey-yoshida-private-submodular-k-submodular-matroid/`
- `2009.01947v5.pdf`
  -> `papers/submodular/2020-chen-kuhnle-practical-parallelizable-nonmonotone-submodular-size-constraint/`
- `2. k-sub.pdf`
  -> `papers/k-submodular/2023-tran-et-al-k-submodular-individual-knapsack/`
- `2101.07157v1.pdf`
  -> `papers/k-submodular/2021-zheng-et-al-maximizing-approximately-k-submodular-functions/`
- `2105.15159v2.pdf`
  -> `papers/k-submodular/2021-tang-wang-chan-corrigendum-monotone-k-submodular-knapsack/`
- `2107.07103v3.pdf`
  -> `papers/k-submodular/2021-huang-wang-zhou-optimal-k-submodular-multilinear-extension/`
- `2109.08863v2.pdf`
  -> preprint / duplicate of `papers/k-submodular/2022-pham-et-al-budgeted-k-submodular-streaming/`
- `2111.07217v1.pdf`
  -> `papers/submodular/2021-liu-et-al-cardinality-submodular-random-streams/`
- `2111.07917v3.pdf`
  -> `papers/submodular/2021-chen-dey-kuhnle-optimal-submodular-maximization-parallel/`
- `2305.16013v1.pdf`
  -> `papers/k-submodular/2025-spaeh-ene-nguyen-online-streaming-constrained-k-submodular/`
- `2306.14520v3.pdf`
  -> `papers/k-submodular/2023-xiao-et-al-k-submodular-knapsack-approximation/`
- `2307.13996v1.pdf`
  -> `papers/k-submodular/2023-niu-et-al-fast-k-submodular-matroid-constraint/`
- `2312.03593v1.pdf`
  -> `papers/k-submodular/2023-wang-et-al-streaming-k-submodular-cover-problem/`
- `2405.05202v3.pdf`
  -> `papers/submodular/2024-chen-et-al-guided-combinatorial-submodular-maximization/`
- `2405.13994v1.pdf`
  -> `papers/submodular/2024-tukan-et-al-practical-0385-cardinality-submodular-maximization/`
- `2406.00148v2.pdf`
  -> `papers/submodular/2024-balkanski-et-al-submodular-maximization-exactly-n-queries/`
- `2411.05318v1.pdf`
  -> `papers/k-submodular/2024-zhu-et-al-fairness-monotone-k-submodular-maximization/`
- `2502.07062v2.pdf`
  -> `papers/submodular/2025-chen-et-al-sublinear-adaptivity-nonmonotone-submodular-1-over-e/`
- `2507.12875v1.pdf`
  -> `papers/k-submodular/2025-wang-budgeted-k-submodular-maximization/`
- `3. SMC.pdf`
  -> `papers/submodular/2023-tran-et-al-streaming-min-cost-submodular-cover/`
- `4. SMK24.pdf`
  -> `papers/submodular/2024-tran-et-al-parallel-nonmonotone-knapsack/`
- `4836_Unconstrained_Submodular_.pdf`
  -> `papers/submodular/2026-anonymous-unconstrained-submodular-maximization-dynamic-setting/`
- `5. k-sub apjor.pdf`
  -> `papers/k-submodular/2025-tran-et-al-k-submodular-individual-knapsack-streaming/`
- `6. DrSubmodular.pdf`
  -> `papers/dr-submodular/2026-tran-pham-fast-nonmonotone-dr-submodular-size/`
- `sub-modular.pdf`
  -> duplicate of the same canonical paper above
- `submodular-functions-matroids-and-certain-polyhedra-53q1tge8w1.pdf`
  -> `papers/submodular/1970-edmonds-submodular-functions-matroids-polyhedra/`
- `badanidiyuru14streaming.pdf`
  -> `papers/submodular/2014-badanidiyuru-et-al-streaming-submodular-maximization/`
- `dr-sub.pdf`
  -> `papers/dr-submodular/2015-soma-yoshida-generalized-submodular-cover-integer-lattice/`
- `duetting24a.pdf`
  -> `papers/submodular/2024-dutting-et-al-consistent-submodular-maximization/`
- `ene22a.pdf`
  -> `papers/k-submodular/2022-ene-nguyen-streaming-monotone-k-submodular-cardinality/`
- `k-sub.pdf`
  -> `papers/k-submodular/2014-ward-zivny-maximizing-k-submodular-functions/`
- `k_sub_matroid_ijcai26.pdf`
  -> `papers/k-submodular/2026-anonymous-fairness-k-submodular-matroid-constraint/`
- `Maximizing-k-submodular-functions-under-budget-constraint-applications-and-streaming-algorithms.pdf`
  -> `papers/k-submodular/2022-pham-et-al-budgeted-k-submodular-streaming/`
- `IEEE_DSAA22_Final_tantd.zip`
  -> `papers/k-submodular/2022-pham-et-al-fast-streaming-k-submodular-knapsack/`
- `inbox/IEEE_DSAA22_Final_tantd/`
  -> extracted source directory for the same canonical paper above
- `min-sub.pdf`
  -> `papers/submodular/2007-iwata-submodular-function-minimization-survey/`
- `minimizie sub.pdf`
  -> `papers/submodular/2000-schrijver-combinatorial-submodular-minimization/`
- `nie23a.pdf`
  -> `papers/k-submodular/2023-nie-et-al-size-constrained-k-submodular-near-linear-time/`
- `nie23a-supp.pdf`
  -> supplementary material for `papers/k-submodular/2023-nie-et-al-size-constrained-k-submodular-near-linear-time/`
- `NIPS-2013-submodular-optimization-with-submodular-cover-and-submodular-knapsack-constraints-Paper.pdf`
  -> `papers/submodular/2013-iyer-bilmes-submodular-cover-knapsack-constraints/`
- `On_submodular_function_minimization.pdf`
  -> `papers/submodular/2007-mccormick-on-submodular-function-minimization/`
- `9658_A_General_Framework_for_D.pdf`
  -> `papers/submodular/2026-anonymous-general-framework-dynamic-consistent-submodular-maximization/`
- `submodular survey.pdf`
  -> `papers/submodular/2019-liu-et-al-greedy-strategies-survey/`
- `submodular.pdf`
  -> duplicate of the same canonical survey above
- `submodular-cover.pdf`
  -> `papers/submodular/1998-bar-ilan-kortsarz-peleg-generalized-submodular-cover/`
- `wz14soda-preprint.pdf`
  -> duplicate of `papers/k-submodular/2014-ward-zivny-maximizing-k-submodular-functions/`

## Suggested Next Processing Order

1. `submodular-functions-matroids-and-certain-polyhedra-53q1tge8w1.pdf`
2. `AN ANALYSIS OF APPROXIMATIONS FOR.pdf`
3. `badanidiyuru14streaming.pdf`
4. `k-sub.pdf`
5. `dr-sub.pdf`

Ly do:

- bat dau bang 2 paper goc quan trong nhat de on dinh `concepts/`
- sau do moi xu ly streaming / k-sub / dr-sub de mo rong taxonomy