An FPTAS for budgeted laminar matroid independent set
From MaRDI portal
Publication:6556192
DOI10.1016/j.orl.2023.10.005MaRDI QIDQ6556192
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
Publication date: 17 June 2024
Published in: Operations Research Letters (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Approximation algorithms for knapsack problems with cardinality constraints
- Worst case compromises in matroids with applications to the allocation of indivisible goods
- Hybrid rounding techniques for knapsack problems
- Approximation Schemes for Multi-Budgeted Independence Systems
- Computer programming as an art
- The Multiple-Choice Knapsack Problem
- On Problems Equivalent to (min,+)-Convolution
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
- The Theory and Computation of Knapsack Functions
- A faster FPTAS for knapsack problem with cardinality constraint
- Approximating Knapsack and partition via dense subset sums
- An EPTAS for budgeted matroid independent set
- An EPTAS for budgeted matching and budgeted matroid intersection via representative sets
Related Items (1)
This page was built for publication: An FPTAS for budgeted laminar matroid independent set
