33 research outputs found
Integrating Storytelling into a Communication Skills Teaching Program for Medical Oncology Fellows
No full text
Simultaneous bilateral magnetic resonance angiography to evaluate thoracic outlet syndrome
No full textEarly signs of multi-walled carbon nanotbues degradation in macrophages, via an intracellular pH-dependent biological mechanism; importance of length and functionalization
No full textAssociation of microsatellite polymorphisms with immune responses to a killed Mycobacterium avium
No full textPlaying to continue being a child and freeing itself from the confinement of the hospitalization under precaution
No full textFeedback Set Problems
No full text. This paper is a short survey of feedback set problems. It will be published in Encyclopedia of Optimization, Kluwer Academic Publishers, 2000. 1. INTRODUCTION In recent years feedback set problems have been the subject of growing interest. They have found applications in many fields, including deadlock prevention [89], program verification [78], and Bayesian inference [2]. Therefore, it is natural that in the past few years there have been intensive efforts on exact and approximation algorithms for these kinds of problems. Exact algorithms have been proposed for solving the problems restricted to special classes of graphs as well as several approximation algorithms with provable bounds for the cases that are not known to be polynomially solvable. The most general feedback set problem consists in finding a minimum-weight (or minimum cardinality) set of vertices (arcs) that meets all cycles in a collection C of cycles in a graph (G,w), where w is a nonnegative function defined on th..
