A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm |
scientific article |
Statements
A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (English)
0 references
26 June 2006
0 references
dominant set
0 references
improvement problem
0 references
inverse problem
0 references
linear fractional combinatorial optimization
0 references
polynomial time algorithm
0 references
