𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matrix representation and gradient flows for NP-hard problems

✍ Scribed by W. S. Wong

Book ID
105491489
Publisher
Springer
Year
1995
Tongue
English
Weight
892 KB
Volume
87
Category
Article
ISSN
0022-3239

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two NP-Hard Art-Gallery Problems for Ort
Two NP-Hard Art-Gallery Problems for Ortho-Polygons
✍ Dietmar Schuchardt; Hans-Dietrich Hecker πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 292 KB

## Abstract D. T. Lee and A. K. Lin [2] proved that VERTEX‐GUARDING and POINT‐GUARDING are NP‐hard for simple polygons. We prove that those problems are NP‐hard for ortho‐polygons, too.

NC-Approximation Schemes for NP- and PSP
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
✍ Harry B Hunt III; Madhav V Marathe; Venkatesh Radhakrishnan; S.S Ravi; Daniel J πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 303 KB

We present NC-approximation schemes for a number of graph problems when restricted to geometric graphs including unit disk graphs and graphs drawn in a civilized manner. Our approximation schemes exhibit the same time versus performance trade-off as the best known approximation schemes for planar gr

Coupling between shear flow and temperat
Coupling between shear flow and temperature gradient for the very hard particles interaction
✍ V. GarzΓ³; J. de la Rubia πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 352 KB

We have constructed a solution of the BGK model kinetic equation to describe a system subject to uniform shear flow and a thermal gradient. The coexistence between both gradients is maintained in the system if the collision frequency is spatially uniform. In our model this particular case correspond