Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
From MaRDI portal
Publication:5096911
DOI10.1007/3-540-58338-6_99zbMath1493.68278OpenAlexW2163939541MaRDI QIDQ5096911
H. Narayanan, Subir Roy, Sachin B. Patkar
Publication date: 18 August 2022
Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58338-6_99
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)
Cites Work
- The principal lattice of partitions of a submodular function
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
- On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
- Use of matroid theory in operations research, circuits and systems theory
- Finding k Cuts within Twice the Optimal
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item