Pages that link to "Item:Q896151"
From MaRDI portal
The following pages link to Approximation for the minimum cost doubly resolving set problem (Q896151):
Displaying 9 items.
- Computation of the double metric dimension in convex polytopes (Q2051724) (← links)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem (Q2065777) (← links)
- Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs (Q2082215) (← links)
- On approximation algorithm for the edge metric dimension problem (Q2220845) (← links)
- Metric-locating-dominating sets of graphs for constructing related subsets of vertices (Q2333263) (← links)
- Schemes of propagation models and source estimators for rumor source detection in online social networks: A short survey of a decade of research (Q5013482) (← links)
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (Q6077937) (← links)
- The doubly metric dimensions of cactus graphs and block graphs (Q6571279) (← links)
- Budget-constrained profit maximization without non-negative objective assumption in social networks (Q6635815) (← links)
