Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004): Difference between revisions

@@ Property / author @@
-Cristina Bazgan
@@ Property / author: Cristina Bazgan / rank @@
-Normal rank
@@ Property / author @@
-Wenceslas Fernandez de la Vega
@@ Property / author: Wenceslas Fernandez de la Vega / rank @@
-Normal rank
@@ Property / author @@
-Marek Karpinski
@@ Property / author: Marek Karpinski / rank @@
-Normal rank
@@ Property / author @@
+Cristina Bazgan
@@ Property / author: Cristina Bazgan / rank @@
+Normal rank
@@ Property / author @@
+Wenceslas Fernandez de la Vega
@@ Property / author: Wenceslas Fernandez de la Vega / rank @@
+Normal rank
@@ Property / author @@
+Marek Karpinski
@@ Property / author: Marek Karpinski / rank @@
+Normal rank
@@ 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.1002/rsa.10072
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.10072 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2074844420
@@ Property / OpenAlex ID: W2074844420 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234075
@@ Property / cites work: Q4234075 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4894603
@@ Property / cites work: Q4894603 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503937
@@ Property / cites work: Q4503937 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate max-flow min-(multi)cut theorems and their applications
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / rank @@
+Normal rank