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

From MaRDI portal
Merged Item from Q2958305
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and integrality gaps for hypergraphic steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-Power Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-weighted Steiner tree approximation in unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the connected sensor cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected facility location via random facility sampling and core detouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound of the Hadwiger number of graphs by their average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extremal function for complete minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Approximation Algorithms for Unit Disk Graphs / rank
 
Normal rank

Revision as of 08:31, 13 July 2024

scientific article; zbMATH DE number 6679756
  • Computing a Tree Having a Small Vertex Cover
Language Label Description Also known as
English
Computing a tree having a small vertex cover
scientific article; zbMATH DE number 6679756
  • Computing a Tree Having a Small Vertex Cover

Statements

Computing a tree having a small vertex cover (English)
0 references
Computing a Tree Having a Small Vertex Cover (English)
0 references
0 references
0 references
10 September 2019
0 references
1 February 2017
0 references
Steiner tree
0 references
unit disk graph
0 references
minor-free graph
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references