Approximation algorithms for finding low-degree subgraphs (Q4651931): Difference between revisions

@@ Property / author @@
-Philip N. Klein
@@ Property / author: Philip N. Klein / rank @@
-Normal rank
@@ Property / author @@
+Philip N. Klein
@@ Property / author: Philip N. Klein / 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/net.20031
@@ Property / full work available at URL: https://doi.org/10.1002/net.20031 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1971422464
@@ Property / OpenAlex ID: W1971422464 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4763417
@@ Property / cites work: Q4763417 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual meets local search
@@ Property / cites work: Primal-dual meets local search / rank @@
+Normal rank
@@ Property / cites work @@
+FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4651931