Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems (Q3196381): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-21398-9_13
+Normal rank
@@ Property / OpenAlex ID @@
+W3023272694
@@ Property / OpenAlex ID: W3023272694 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3327527
@@ Property / cites work: Q3327527 / rank @@
+Normal rank
@@ Property / cites work @@
+Simplex partitioning via exponential clocks and the multiway cut problem
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q4931752
@@ Property / cites work: Q4931752 / rank @@
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for classification problems with pairwise relationships
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Graph Homomorphism Problems
+Normal rank
@@ Property / cites work @@
+Algorithmic aspects of homophyly of networks
@@ Property / cites work: Algorithmic aspects of homophyly of networks / rank @@
+Normal rank
@@ Property / cites work @@
+Multiway cut, pairwise realizable distributions, and descending thresholds
+Normal rank