Computing a tree having a small vertex cover (Q2272400): Difference between revisions

@@ aliases / en / 0 / aliases / en / 0 @@
+Computing a Tree Having a Small Vertex Cover
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6679756
@@ Property / title @@
+Computing a Tree Having a Small Vertex Cover (English)
@@ Property / title: Computing a Tree Having a Small Vertex Cover (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68237
@@ Property / zbMATH Open document ID: 1436.68237 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-48749-6_6
@@ Property / DOI: 10.1007/978-3-319-48749-6_6 / rank @@
+Normal rank
@@ Property / published in @@
+Combinatorial Optimization and Applications
@@ Property / published in: Combinatorial Optimization and Applications / rank @@
+Normal rank
@@ Property / publication date @@
+February 2017Timestamp +2017-02-01T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-02-01T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 1 February 2017 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6679756
@@ Property / zbMATH DE Number: 6679756 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2945240418
@@ Property / OpenAlex ID: W2945240418 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2545708558
@@ Property / OpenAlex ID: W2545708558 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.08897
@@ Property / arXiv ID: 1701.08897 / rank @@
+Normal rank
@@ Property / cites work @@
+Steiner Tree Approximation via Iterative Randomized Rounding
+Normal rank
@@ Property / cites work @@
+Matroids and integrality gaps for hypergraphic steiner tree relaxations
+Normal rank
@@ Property / cites work @@
+Q4234152
@@ Property / cites work: Q4234152 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365097
@@ Property / cites work: Q5365097 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-Power Covering Problems
@@ Property / cites work: Min-Power Covering Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
+Normal rank
@@ Property / cites work @@
+Node-weighted Steiner tree approximation in unit disk graphs
+Normal rank
@@ Property / cites work @@
+Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the connected sensor cover problem
+Normal rank
@@ Property / cites work @@
+New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
+Normal rank
@@ Property / cites work @@
+Connected facility location via random facility sampling and core detouring
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for connected facility location problems
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+The extremal function for complete minors
@@ Property / cites work: The extremal function for complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-Time Approximation Algorithms for Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Q5743501
@@ Property / cites work: Q5743501 / rank @@
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Survivable networks, linear programming relaxations and the parsimonious property
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
+Normal rank
@@ Property / cites work @@
+A PTAS for the Weighted Unit Disk Cover Problem
@@ Property / cites work: A PTAS for the Weighted Unit Disk Cover Problem / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127826239
@@ Property / Wikidata QID: Q127826239 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2272400