𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Continuous reductions among combinatorial optimization problems

✍ Scribed by Hans Ulrich Simon

Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
745 KB
Volume
26
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel algebraic reductions among nume
Parallel algebraic reductions among numerical problems
✍ B. Codenotti; M. Leoncini; G. Resta πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 372 KB

In this note we consider, for a number of linear algebra problems, an environment allowing approximate computations. Within this framework we show that the relative complexity of these problems should be studied according to a strict notion of reducibility, which corresponds to the well-known many-o

On simple combinatorial optimization pro
On simple combinatorial optimization problems
✍ A.J. Hoffman πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.

Domination analysis of combinatorial opt
Domination analysis of combinatorial optimization problems
✍ Gregory Gutin; Alek Vainshtein; Anders Yeo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 141 KB

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classiΓΏcation of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TSP (both symmetric and asymmetric versions) is DOM-e