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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2019.05.018 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2019.05.018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Single and Multi-Commodity Connected Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the Weighted Unit Disk Cover Problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127826239 / rank
 
Normal rank

Latest revision as of 11:06, 28 December 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
0 references
0 references
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
0 references