Secluded connectivity problems (Q1679225)

From MaRDI portal

Revision as of 16:13, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 6208853

Secluded Connectivity Problems

Language	Label	Description	Also known as
English	Secluded connectivity problems	scientific article; zbMATH DE number 6208853	Secluded Connectivity Problems

Statements

scholarly article

0 references

Secluded connectivity problems (English)

0 references

Secluded Connectivity Problems (English)

0 references

0 references

0 references

0 references

Matthew P. Johnson

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

9 November 2017

0 references

17 September 2013

0 references

full work available at URL

https://arxiv.org/abs/1212.6176

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A linear time algorithm for finding tree-decompositions of small treewidth

0 references

0 references

Treewidth: Structure and Algorithms

0 references

0 references

Improved Steiner Tree Algorithms for Bounded Treewidth

0 references

On the hardness of approximating label-cover

0 references

A threshold of ln <i>n</i> for approximating set cover

0 references

The parameterized complexity of some minimum label problems

0 references

The Rectilinear Steiner Tree Problem is $NP$-Complete

0 references

Approximation algorithms and hardness results for labeled connectivity problems

0 references

Secluded Path via Shortest Path

0 references

Reducibility among Combinatorial Problems

0 references

Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

0 references

A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees

0 references

On the minimum label spanning tree problem

0 references

The labeled perfect matching in bipartite graphs

0 references

Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems

0 references

Graph minors. II. Algorithmic aspects of tree-width

0 references

Approximation and hardness results for label cut and related problems

0 references

Identifiers

zbMATH Open document ID

0 references

0 references

10.1007/s00453-016-0222-z

0 references

10.1007/978-3-642-40450-4_26

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1679225

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1679225&oldid=36355482"