scientific article; zbMATH DE number 3869066
From MaRDI portal
Publication:3337223
Recommendations
Cited in
(45)- Combinatorial algorithms for feedback problems in directed graphs
- Resource allocation in bounded degree trees
- A new approach for approximating node deletion problems
- A bounded approximation for the minimum cost 2-sat problem
- The maximum clique problem
- Approximation for vertex cover in -conflict graphs
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs
- Distributed approximation of k-service assignment
- Flexible allocation on related machines with assignment restrictions
- Greedy -approximation algorithm for covering with arbitrary constraints and submodular cost
- A primal-dual approximation algorithm for \textsc{minsat}
- Approximation algorithm for minimum weight connected-\(k\)-subgraph cover
- An approximation of the minimum vertex cover in a graph
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
- A 2-approximation NC algorithm for connected vertex cover and tree cover
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses
- Vertex cover in conflict graphs
- Admission control with advance reservations in simple networks
- Safe approximation and its relation to kernelization
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- The minimum generalized vertex cover problem
- An approximation algorithm for the minimum weighted vertex-cover problem
- scientific article; zbMATH DE number 3853131 (Why is no real title available?)
- Results on the min-sum vertex cover problem
- A Primal-Dual Method for Approximating Tree Cover with Two Weights
- Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
- Reoptimization of Weighted Graph and Covering Problems
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs
- Bandwidth allocation in cellular networks with multiple interferences
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
- Introduction to QUBO
- Autarkies and Persistencies for QUBO
- A constant factor approximation algorithm for the storage allocation problem
- Semi-streaming algorithms for submodular matroid intersection
- Semi-streaming algorithms for submodular matroid intersection
- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
- Distributed algorithms for covering, packing and maximum weighted matching
- Randomized approximation of bounded multicovering problems
- On the multi-radius cover problem
- Node-weighted Steiner tree approximation in unit disk graphs
- Using fractional primal-dual to schedule split intervals with demands
- Exploiting locality: Approximating sorting buffers
- Improved approximation algorithm for convex recoloring of trees
- A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem
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 Q3337223)
