An FPTAS for budgeted laminar matroid independent set
From MaRDI portal
Publication:6556192
Cites work
- A faster FPTAS for knapsack problem with cardinality constraint
- A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
- An EPTAS for budgeted matching and budgeted matroid intersection via representative sets
- An EPTAS for budgeted matroid independent set
- Approximating Knapsack and partition via dense subset sums
- Approximation algorithms for knapsack problems with cardinality constraints
- Approximation Schemes for Multi-Budgeted Independence Systems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Computer programming as an art
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Hybrid rounding techniques for knapsack problems
- Multi-budgeted matchings and matroid intersection via dependent rounding
- On problems equivalent to \((\min,+)\)-convolution
- Secretary problems: laminar matroid and interval scheduling
- The Multiple-Choice Knapsack Problem
- The Theory and Computation of Knapsack Functions
- Worst case compromises in matroids with applications to the allocation of indivisible goods
Cited in
(7)- Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs
- Lower bounds for matroid optimization problems with a linear constraint
- An improved FPTAS for budgeted laminar matroid independent set
- An EPTAS for cardinality constrained multiple knapsack via iterative randomized rounding
- Budgeted matroid maximization: a parameterized viewpoint
- Unsplittable flow on a short path
- Single-machine and flow-shop scheduling with supporting tasks in a nested structure
This page was built for publication: An FPTAS for budgeted laminar matroid independent set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556192)
