Pages that link to "Item:Q4228484"
From MaRDI portal
The following pages link to A threshold of \(\ln n\) for approximating set cover (Q4228484):
Displaying 33 items.
- Greedy approximations for minimum submodular cover with submodular cost (Q2379694) (← links)
- A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- Routing-efficient CDS construction in disk-containment graphs (Q2448125) (← links)
- On the minimum monochromatic or multicolored subgraph partition problems (Q2456352) (← links)
- Minimum monopoly in regular and tree graphs (Q2497525) (← links)
- On the connectivity preserving minimum cut problem (Q2637652) (← links)
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- (Q2941638) (← links)
- A threshold of ln <i>n</i> for approximating set cover (Q3158517) (← links)
- Pick, pack, \& survive: charging robots in a modern warehouse based on online connected dominating sets (Q3301010) (← links)
- Improved Approximation Algorithm for Fault-Tolerant Facility Placement (Q3453283) (← links)
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions (Q3460781) (← links)
- On Partial Covers, Reducts and Decision Rules (Q3600307) (← links)
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (Q4210164) (← links)
- On the hardness of approximating minimization problems (Q4323730) (← links)
- A Tight Analysis of the Greedy Algorithm for Set Cover (Q4373001) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- Probabilistic proof systems — A survey (Q5048957) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem (Q5056912) (← links)
- Approximation algorithms for a genetic diagnostics problem (Q5096927) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
- An efficient distributed algorithm for constructing small dominating sets (Q5138380) (← links)
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint (Q5918331) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- Combinatorial optimization algorithms for radio network planning (Q5941516) (← links)
- Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)