Cut problems in graphs with a budget constraint (Q2457298): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2006.05.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037387767 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cut problems in graphs with a budget constraint |
scientific article |
Statements
Cut problems in graphs with a budget constraint (English)
0 references
30 October 2007
0 references
approximation algorithms
0 references
budget problems
0 references
graph theory
0 references
cut problems
0 references
combinatorial optimization
0 references
