Pages that link to "Item:Q648055"
From MaRDI portal
The following pages link to Design and analysis of approximation algorithms (Q648055):
Displaying 41 items.
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- A PTAS for minimum weighted connected vertex cover \(P_3\) problem in 3-dimensional wireless sensor networks (Q512868) (← links)
- A novel approach for detecting multiple rumor sources in networks with partial observations (Q512871) (← links)
- On positive-influence target-domination (Q526426) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- A short proof for stronger version of DS decomposition in set function optimization (Q830927) (← links)
- Approximation for the minimum cost doubly resolving set problem (Q896151) (← links)
- On general threshold and general cascade models of social influence (Q1698071) (← links)
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) (← links)
- Approximation algorithms for the submodular edge cover problem with submodular penalties (Q2031056) (← links)
- Algorithms and complexity for a class of combinatorial optimization problems with labelling (Q2031932) (← links)
- Time sensitive sweep coverage with minimum UAVs (Q2079882) (← 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)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- A variation of DS decomposition in set function optimization (Q2185813) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- Minimizing data collection latency with unmanned aerial vehicle in wireless sensor networks (Q2279744) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Handling least privilege problem and role mining in RBAC (Q2352353) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
- Approximation algorithm for the minimum weight connected \(k\)-subgraph cover problem (Q2447765) (← links)
- Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network (Q2682914) (← links)
- Greedy guarantees for non-submodular function maximization under independent system constraint with applications (Q2696953) (← links)
- Sensor Cover and Double Partition (Q2820119) (← links)
- In Memoriam: Ker-I Ko (1950–2018) (Q3297820) (← links)
- SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT (Q4626601) (← links)
- Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
- A Branch-and-Cut Algorithm for Submodular Interdiction Games (Q5058006) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- New approximations for Maximum Lifetime Coverage (Q5169461) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Algorithms for randomized time-varying knapsack problems (Q5963612) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (Q6077937) (← links)
- Approximation algorithm for (connected) Italian dominating function (Q6090069) (← links)
- Greedy is good: constrained non-submodular function maximization via weak submodularity (Q6601966) (← links)
- Total (restrained) domination in unit disk graphs (Q6614890) (← links)
