scientific article; zbMATH DE number 1256748
From MaRDI portal
Publication:4228484
Recommendations
Cited in
(92)- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
- A better constant-factor approximation for weighted dominating set in unit disk graph
- \(O(n \log n)\) procedures for tightening cover inequalities
- Modifying edges of a network to obtain short subgraphs
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Class Steiner trees and VLSI-design
- Approximating the weight of shallow Steiner trees
- On the difficulty of approximately maximizing agreements.
- Approximating covering integer programs with multiplicity constraints
- Alarm placement in systems with fault propagation
- On the limits of nonapproximability of lattice problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Generalized submodular cover problems and applications
- On the flow cost lowering problem
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- On approximability of the independent/connected edge dominating set problems
- Approximation algorithms for terrain guarding.
- Local majorities, coalitions and monopolies in graphs: A review
- Relational data factorization
- The complexity of base station positioning in cellular networks
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Wireless networking, dominating and packing
- Improving spanning trees by upgrading nodes
- Improved non-approximability results for minimum vertex cover with density constraints
- On approximation of the submodular set cover problem
- Finding the maximal adversary structure from any given access structure
- Approximation algorithm for the partial set multi-cover problem
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
- Optimal approximations made easy
- Parallel algorithm for minimum partial dominating set in unit disk graph
- On the edge capacitated Steiner tree problem
- Minimum non-submodular cover problem with applications
- A primal-dual algorithm for the minimum partial set multi-cover problem
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- Construction of component tapes for radial placement machines
- Greedy approximations for minimum submodular cover with submodular cost
- A 2-approximation NC algorithm for connected vertex cover and tree cover
- Local ratio method on partial set multi-cover
- The Steiner connectivity problem
- Routing-efficient CDS construction in disk-containment graphs
- On the minimum monochromatic or multicolored subgraph partition problems
- Minimum monopoly in regular and tree graphs
- On the connectivity preserving minimum cut problem
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
- An improved approximation scheme for the Group Steiner Problem
- Improved performance of the greedy algorithm for partial cover
- scientific article; zbMATH DE number 6474898 (Why is no real title available?)
- A threshold of ln n for approximating set cover
- The projection games conjecture and the NP-hardness of n-approximating Set-Cover
- New and improved bounds for the minimum set cover problem
- Pick, pack, \& survive: charging robots in a modern warehouse based on online connected dominating sets
- Improved approximation algorithm for fault-tolerant facility placement
- Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
- On the union of intermediate nodes of shortest paths
- On Partial Covers, Reducts and Decision Rules
- Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
- Approximation algorithms for a geometric set cover problem
- On the hardness of approximating minimization problems
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Complexity of minimum corridor guarding problems
- Improving spanning trees by upgrading nodes
- scientific article; zbMATH DE number 1855640 (Why is no real title available?)
- Probabilistic proof systems -- a survey
- Service-constrained network design problems
- Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
- Approximation algorithms for a genetic diagnostics problem
- Intractability of assembly sequencing: unit disks in the plane
- Integrated Supply Chain Management via Randomized Rounding
- An efficient distributed algorithm for constructing small dominating sets
- Evaluation of monotone DNF formulas
- Deep approximation of set cover greedy algorithm for test set
- Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- Upgrading bottleneck constrained forests
- Combinatorial optimization algorithms for radio network planning
- Reload cost problems: Minimum diameter spanning tree
- Improved non-approximability results for vertex cover with density constraints
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
- Preserving approximation in the min-weighted set cover problem
- Satisfiability to coverage in presence of fairness, matroid, and global constraints
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- Dynamic algorithms for maximizing a DR-submodular function subtracted by a linear function over the integer lattice
- Learn to optimize from structured samples for minimum partial set cover
- Center-based clustering under perturbation stability
- A derandomization using min-wise independent permutations
- Optimizing cost flows by edge cost and capacity upgrade
- Budget constrained minimum cost connected medians
- Self-improved gaps almost everywhere for the agnostic approximation of monomials
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership
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 Q4228484)
