scientific article; zbMATH DE number 3495588
From MaRDI portal
Publication:4077442
Cited in
(30)- Toward a unified approach for the classification of NP-complete optimization problems
- Non deterministic polynomial optimization problems and their approximations
- Theoretical complexity of grid cover problems used in radar applications
- Maximum subset intersection
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- Differentiating-total domination: approximation and hardness results
- Generalizations and strengthenings of Ryser's conjecture
- Efficient approximation algorithms for maximum coverage with group budget constraints
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- A practical greedy approximation for the directed Steiner tree problem
- On covering by translates of a set
- On the complexity of the minimum independent set partition problem
- A practical greedy approximation for the directed Steiner tree problem
- scientific article; zbMATH DE number 3572042 (Why is no real title available?)
- Computing on binary strings
- An exact method for the minimum feedback arc set problem
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection
- Covering edges in networks
- Tight approximation algorithms for ordered covering
- Solving MAX-\(r\)-SAT above a tight lower bound
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Hitting sets when the shallow cell complexity is small
- Distributed algorithms for covering, packing and maximum weighted matching
- On solution discovery via reconfiguration
- The complexity of landmark hub labeling
- Approximating -covering
- Subtrajectory clustering and coverage maximization in cubic time, or better
- Covering a few submodular constraints and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077442)
