Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (Q5096911): Difference between revisions

Latest revision as of 22:46, 29 July 2024

scientific article; zbMATH DE number 7573215

Language	Label	Description	Also known as
English	Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach	scientific article; zbMATH DE number 7573215

Statements

instance of

scholarly article

0 references

title

Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach (English)

0 references

zbMATH Open document ID

1493.68278

0 references

DOI

10.1007/3-540-58338-6_99

0 references

0 references

0 references

0 references

Mathematical Foundations of Computer Science 1994

0 references

publication date

18 August 2022

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-58338-6_99

0 references

0 references

0 references

NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS

0 references

Use of matroid theory in operations research, circuits and systems theory

0 references

Q3048571

0 references

An \(O(IVI^3)\) algorithm for finding maximum flows in networks

0 references

On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis

0 references

The principal lattice of partitions of a submodular function

0 references

Q4246714

0 references

Q4246752

0 references

Finding <i>k</i> Cuts within Twice the Optimal

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5096911

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-58338-6_99
+Normal rank
@@ Property / OpenAlex ID @@
+W2163939541
@@ Property / OpenAlex ID: W2163939541 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
+Normal rank
@@ Property / cites work @@
+Use of matroid theory in operations research, circuits and systems theory
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(IVI^3)\) algorithm for finding maximum flows in networks
+Normal rank
@@ Property / cites work @@
+On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
+Normal rank
@@ Property / cites work @@
+The principal lattice of partitions of a submodular function
+Normal rank
@@ Property / cites work @@
+Q4246714
@@ Property / cites work: Q4246714 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4246752
@@ Property / cites work: Q4246752 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5096911