Regular ArticleGreedy Local Improvement and Weighted Set Packing Approximation☆
References (10)
- et al.
Nonoverlapping local alignments (Weighted independent sets of axis-parallel rectangles)
Discrete Appl. Math.
(1996) - et al.
How easy is local search?
J. Comput. System Sci.
(1988) - et al.
Approximating weighted set packing by local search
Math. Oper. Res.
(1998) A d/2 approximation for maximum weight independent set in d-claw free graphs
Proceedings, Seventh Scandinavian Workshop on Algebraic Theory (SWAT)
(July 2000)
There are more references available in the full text version of this article.
Cited by (112)
Algorithms and computational study on a transportation system integrating public transit and ridesharing of personal vehicles
2024, Computers and Operations ResearchHow heavy independent sets help to find arborescences with many leaves in DAGs
2023, Journal of Computer and System SciencesGreediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
2023, Procedia Computer ScienceBenefits of small-size communities for continuous cost-optimization in peer-to-peer energy sharing
2021, Applied EnergyCitation Excerpt :Moreover, to be complete, we also need to consider the extra difficulty that the weights are not provided beforehand but can only be estimated online (potentially using past and forecasted data) and this requires extra communication between the peers. Finally, we note that the greedy (and the greedy-largest) matching extends naturally to “greedy partitioning” replacing pairs by groups of larger sizes [32]. Partitioning prosumers into sharing communities has recently been explored in [21,33] while focusing in forming stable partitions, that are driven by individual interests rather than a common one.
Algorithms for the Ridesharing with Profit Constraint Problem
2024, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 2001 Academic Press. All rights reserved.