scientific article; zbMATH DE number 3495588
From MaRDI portal
Publication:4077442
zbMath0316.68024MaRDI QIDQ4077442
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Generalizations and strengthenings of Ryser's conjecture ⋮ Theoretical complexity of grid cover problems used in radar applications ⋮ From the quantum approximate optimization algorithm to a quantum alternating operator ansatz ⋮ CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection ⋮ Unnamed Item ⋮ A practical greedy approximation for the directed Steiner tree problem ⋮ On the Complexity of the Minimum Independent Set Partition Problem ⋮ A Practical Greedy Approximation for the Directed Steiner Tree Problem ⋮ An Exact Method for the Minimum Feedback Arc Set Problem ⋮ Covering edges in networks ⋮ Toward a unified approach for the classification of NP-complete optimization problems ⋮ Clustering in Hypergraphs to Minimize Average Edge Service Time ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Tight approximation algorithms for ordered covering ⋮ Maximum subset intersection ⋮ Non deterministic polynomial optimization problems and their approximations ⋮ Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost ⋮ Solving MAX-\(r\)-SAT above a tight lower bound ⋮ Computing on binary strings ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Differentiating-total domination: approximation and hardness results ⋮ On covering by translates of a set ⋮ Efficient approximation algorithms for maximum coverage with group budget constraints
