On approximating maximum covering cycles in undirected graphs (Q2414126): 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.1007/s11590-018-1293-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2809800811 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A relax-and-cut framework for large-scale maximum weight connected subgraph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching for a cycle with maximum coverage in undirected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On approximating the longest path in a graph / rank | |||
Normal rank | |||
Latest revision as of 06:19, 19 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On approximating maximum covering cycles in undirected graphs |
scientific article |
Statements
On approximating maximum covering cycles in undirected graphs (English)
0 references
10 May 2019
0 references
undirected graphs
0 references
maximum covering cycle
0 references
approximation
0 references
