Greediness is not always a vice: Efficient discovery algorithms for assignment problems
Uložené v:
| Názov: | Greediness is not always a vice: Efficient discovery algorithms for assignment problems |
|---|---|
| Autori: | Duvignau, Romaric, 1989, Gillet, Noël, Klasing, Ralf |
| Zdroj: | SESBC TANDEM: Intelligent hantering av energidata och beslutsfattande i realtid Discrete Applied Mathematics. 378:65-86 |
| Predmety: | Assignment problem, Discovery algorithms, Query complexity, Greedy algorithms |
| Popis: | Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and introduce in this work the “discovery” variant considering edge weights that are not provided as input but must be queried, requiring additional and costly computations. We develop discovery algorithms here to minimize the number of queried weights while providing guarantees on the computed solution. In this work, we first show the inherent challenges of designing discovery algorithms for general assignment problems. We then provide and analyze several efficient greedy algorithms that can make use of natural assumptions about the order in which the nodes are processed by the algorithms. Our motivations for exploring this problem stem from finding practical solutions to a variation of maximum weight matching in bipartite hypergraphs, a problem recently emerging in the formation of peer-to-peer energy-sharing communities. |
| Popis súboru: | electronic |
| Prístupová URL adresa: | https://research.chalmers.se/publication/547520 https://research.chalmers.se/publication/547520/file/547520_Fulltext.pdf |
| Databáza: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and introduce in this work the “discovery” variant considering edge weights that are not provided as input but must be queried, requiring additional and costly computations. We develop discovery algorithms here to minimize the number of queried weights while providing guarantees on the computed solution. In this work, we first show the inherent challenges of designing discovery algorithms for general assignment problems. We then provide and analyze several efficient greedy algorithms that can make use of natural assumptions about the order in which the nodes are processed by the algorithms. Our motivations for exploring this problem stem from finding practical solutions to a variation of maximum weight matching in bipartite hypergraphs, a problem recently emerging in the formation of peer-to-peer energy-sharing communities. |
|---|---|
| ISSN: | 0166218X |
| DOI: | 10.1016/j.dam.2025.06.020 |