scientific article; zbMATH DE number 1256762
From MaRDI portal
Publication:4228498
zbMath0942.68773MaRDI QIDQ4228498
Publication date: 3 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Minimizing the stretch when scheduling flows of divisible requests ⋮ Improved approximation algorithms for the spanning star forest problem ⋮ Distributed minimum dominating set approximations in restricted families of graphs ⋮ Approximation algorithms for a genetic diagnostics problem ⋮ GRMA: generalized range move algorithms for the efficient optimization of MRFs ⋮ Safe sets and in-dominating sets in digraphs ⋮ Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation ⋮ Tight approximation algorithms for ordered covering ⋮ A set-cover-based approach for the test-cost-sensitive attribute reduction problem ⋮ A probabilistic alternative to regression suites ⋮ Approximating the online set multicover problems via randomized winnowing ⋮ Tight approximability results for test set problems in bioinformatics ⋮ Combinatorial approximation algorithms: a comparative review ⋮ On the differential approximation of MIN SET COVER ⋮ On point covers of \(c-\)oriented polygons ⋮ Optimally learning social networks with activations and suppressions ⋮ On Partial Covers, Reducts and Decision Rules ⋮ Minimum constellation covers: hardness, approximability and polynomial cases ⋮ Completeness in approximation classes beyond APX ⋮ A set covering based approach to find the reduct of variable precision rough set ⋮ Constant-time distributed dominating set approximation ⋮ Unnamed Item ⋮ Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis ⋮ Fast stabbing of boxes in high dimensions ⋮ A fuzzy genetic algorithm for driver scheduling ⋮ Tight bounds on subexponential time approximation of set cover and related problems
This page was built for publication:
