Optimal cuts and partitions in tree metrics in polynomial time (Q396629): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 1212.3471 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3002852 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5365095 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549709 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random sampling and approximation of MAX-CSPs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tensor decomposition and approximation schemes for constraint satisfaction problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4500688 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spectral methods for matrices and tensors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4708558 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5315023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank | |||
Normal rank |
Latest revision as of 22:11, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal cuts and partitions in tree metrics in polynomial time |
scientific article |
Statements
Optimal cuts and partitions in tree metrics in polynomial time (English)
0 references
13 August 2014
0 references
computational complexity
0 references
optimal cut
0 references
optimal bisection
0 references
tree metric
0 references
geometric metric
0 references
polynomial time
0 references