Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Efficiency analysis of GREEDI algorithm under delta-matroid constraints for subset selection in distributed systems
Saved in:
| Published in: | Радіоелектронні і комп'ютерні системи |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2025
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Efficiency analysis of GREEDI algorithm under delta-matroid constraints for subset selection in distributed systems
- Matroid Algorithms Under Size-Sensitive Independence Oracles
- A greedy maximal sweepline algorithm for a Jordan curve
- A note on the parameter $ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
- An $widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
- Deletion Robust Non-Monotone Submodular Maximization over Matroids
- Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions