Pages that link to "Item:Q1838034"
From MaRDI portal
The following pages link to An analysis of the greedy algorithm for the submodular set covering problem (Q1838034):
Displaying 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- Augmenting edge-connectivity between vertex subsets (Q472470) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- On positive-influence target-domination (Q526426) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- On minimum submodular cover with submodular cost (Q540698) (← links)
- New dominating sets in social networks (Q604953) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- Approximability of sparse integer programs (Q634673) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Approximability and inapproximability of the minimum certificate dispersal problem (Q982648) (← links)
- Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
- A note on submodular set cover on matroids (Q1045066) (← links)
- Approximations for subset interconnection designs (Q1274995) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- On approximability of the independent/connected edge dominating set problems (Q1603390) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach (Q1626929) (← links)
- Submodular learning and covering with response-dependent costs (Q1663646) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- \(O(f)\) bi-criteria approximation for capacitated covering with hard capacities (Q1741845) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On approximation of the submodular set cover problem (Q1969763) (← links)
- Parametric monotone function maximization with matroid constraints (Q2010096) (← links)
- Sparse approximate solutions to max-plus equations (Q2061850) (← links)
- Approximation algorithm for vertex cover with multiple covering constraints (Q2072095) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386) (← links)
- Tight bounds on subexponential time approximation of set cover and related problems (Q2117696) (← links)
- Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems: a new approach using secants (Q2163754) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Iterative partial rounding for vertex cover with hard capacities (Q2223692) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- Network construction with subgraph connectivity constraints (Q2253960) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- Sparsity in max-plus algebra and systems (Q2286330) (← links)
- Set function optimization (Q2314057) (← links)
- Minimizing ratio of monotone non-submodular functions (Q2326079) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
