Name
Abstract | ||
|---|---|---|
We show that seven discrete optimization problems from different fields of discrete mathematics (such as linear algebra, combinatorics, ] geometry, and functional analysis) that at first sight seem to be quite different prove to be in fact rather close to each other. This closeness enables us, given an algorithm for one problem, to construct an optimization or approximation algorithm for solving the other problems in the list. For each problem, an extremum function is defined which characterizes the performance of the optimal solution of the problem in the worst case. Relations between these extremum functions are derived. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/3-540-63397-9_34 | ESA |
Keywords | Field | DocType |
linear algebra,discrete optimization,discrete mathematics,functional analysis | Discrete mathematics,Linear algebra,Approximation algorithm,Combinatorics,Closeness,Combinatorial optimization,Discrete optimization problem,Optimization problem,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-63397-9 | 0 | 0.34 |
References | Authors | |
2 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergey V. Sevastianov | 1 | 66 | 7.09 |