𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation and hardness results for label cut and

✍ Scribed by Peng Zhang; Jin-Yi Cai; Lin-Qing Tang; Wen-Bo Zhao

Publisher
Springer US
Year
2009
Tongue
English
Weight
529 KB
Volume
21
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Near-optimal hardness results and approx
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
✍ Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; Bruce Shepherd; Mihali πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 308 KB

We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths (EDP) problem, we are given a network G with source-sink pairs ðs i ; t i Þ; 1pipk; and the goal is to find a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjo

Acidic and basic molecular hardness in L
Acidic and basic molecular hardness in LCAO approximation
✍ Robert Balawender; Ludwik Komorowski; Szczepan Roszak πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

Hardness of a molecule has been formulated as an average of a set of terms representing various types of reactivity. Hardness parameters for molecules and bonded atoms have Ž . been calculated by the ab initio Hartree᎐Fock self-consistent field HF SCF method. An analysis has been presented of the co