Overflow management with self-eliminations
From MaRDI portal
Recommendations
Cites work
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- Buffer Overflow Management in QoS Switches
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Competitive router scheduling with structured data
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Independent sets with domination constraints
- Introduction to Coding Theory
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On the complexity of approximating \(k\)-dimensional matching
- On the complexity of approximating \(k\)-set packing
- Online scheduling with interval conflicts
- Online set packing
- Optimal smoothing schedules for real-time streams
- Scheduling multipacket frames with frame deadlines
- Shrinking maxima, decreasing costs: new online packing and covering problems
Cited in
(3)
This page was built for publication: Overflow management with self-eliminations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925615)