Approximation algorithms for finding low-degree subgraphs (Q4651931): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971422464 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4763417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Primal-dual meets local search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040221 / rank | |||
Normal rank | |||
Latest revision as of 18:59, 7 June 2024
scientific article; zbMATH DE number 2137954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for finding low-degree subgraphs |
scientific article; zbMATH DE number 2137954 |
Statements
Approximation algorithms for finding low-degree subgraphs (English)
0 references
23 February 2005
0 references
approximation algorithms
0 references
minimum-degree subgraphs
0 references
graph algorithms
0 references
network design
0 references
graph connectivity
0 references
NP-hard problems
0 references
