The following pages link to (Q4077442):
Displaying 22 items.
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- Computing on binary strings (Q476852) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Distributed algorithms for covering, packing and maximum weighted matching (Q661048) (← links)
- Toward a unified approach for the classification of NP-complete optimization problems (Q1143789) (← links)
- Non deterministic polynomial optimization problems and their approximations (Q1152215) (← links)
- Theoretical complexity of grid cover problems used in radar applications (Q1626552) (← links)
- Maximum subset intersection (Q1944892) (← links)
- Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost (Q1949749) (← links)
- Differentiating-total domination: approximation and hardness results (Q2034786) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- A Practical Greedy Approximation for the Directed Steiner Tree Problem (Q2942396) (← links)
- On covering by translates of a set (Q3068760) (← links)
- On the Complexity of the Minimum Independent Set Partition Problem (Q3196378) (← links)
- (Q4143192) (← links)
- An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
- Clustering in Hypergraphs to Minimize Average Edge Service Time (Q5111753) (← links)
- CLUSTAG & WCLUSTAG: Hierarchical Clustering Algorithms for Efficient Tag-SNP Selection (Q5302422) (← links)
- Covering edges in networks (Q6087399) (← links)
