Pages that link to "Item:Q3910012"
From MaRDI portal
The following pages link to A linear-time approximation algorithm for the weighted vertex cover problem (Q3910012):
Displaying 47 items.
- Online budgeted maximum coverage (Q1979466) (← links)
- Approximation algorithm for stochastic set cover problem (Q2039642) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- A reduction tree approach for the discrete time/cost trade-off problem (Q2147020) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Efficient approximation algorithms for maximum coverage with group budget constraints (Q2317355) (← links)
- A primal-dual approximation algorithm for partial vertex cover: Making educated guesses (Q2391176) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
- Admission control with advance reservations in simple networks (Q2466012) (← links)
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems (Q2496053) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem (Q2661992) (← links)
- Query-competitive sorting with uncertainty (Q2663045) (← links)
- An approximation algorithm for \(P\)-prize-collecting set cover problem (Q2687689) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
- Resource allocation problem under single resource assignment (Q4553878) (← links)
- Improved Algorithm for Resource Allocation Problems (Q4604919) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover (Q4630249) (← links)
- Efficient Online Linear Optimization with Approximation Algorithms (Q4991673) (← links)
- (Q5009491) (← links)
- A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems (Q5058125) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
- The multi‐integer set cover and the facility terminal cover problem (Q5191129) (← links)
- Capacitated Domination Problem (Q5387762) (← links)
- The Minimum Substring Cover Problem (Q5443381) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5918419) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
- On the primer selection problem in polymerase chain reaction experiments (Q5961627) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- Competitive vertex recoloring. (Online disengagement) (Q6107890) (← links)
- Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
- Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)
- Hitting sets when the shallow cell complexity is small (Q6574945) (← links)
- Online multiset submodular cover (Q6582377) (← links)
- Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints (Q6657233) (← links)