Finding Optimal Solutions With Neighborly Help. (Q5092442): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
label / en | label / en | ||
Finding Optimal Solutions With Neighborly Help. | |||
Property / DOI | |||
Property / DOI: 10.4230/LIPIcs.MFCS.2019.78 / rank | |||
Property / cites work | |||
Property / cites work: Reoptimizing the traveling salesman problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the autoreducibility of functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873740 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of Kemeny elections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Turán's theorem and <i>k</i>‐connected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of facets resolved / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling with forbidden sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded Query Classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: More complicated questions about maxima and minima, and some closures of NP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686744 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2970391455 / rank | |||
Normal rank | |||
Property / title | |||
Finding Optimal Solutions With Neighborly Help. (English) | |||
Property / title: Finding Optimal Solutions With Neighborly Help. (English) / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.4230/LIPICS.MFCS.2019.78 / rank | |||
Normal rank |
Latest revision as of 15:54, 30 December 2024
scientific article; zbMATH DE number 7561722
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding Optimal Solutions With Neighborly Help. |
scientific article; zbMATH DE number 7561722 |
Statements
21 July 2022
0 references
critical graphs
0 references
computational complexity
0 references
structural self-reducibility
0 references
minimality problems
0 references
colorability
0 references
vertex cover
0 references
satisfiability
0 references
reoptimizat
0 references
Finding Optimal Solutions With Neighborly Help. (English)
0 references