π
π
The Cartographer
Solving Minimum k-supplier in Adleman-Lipton model
January 17, 2018 Β· Declared Dead Β· π 2017 International Conference on Computational Science and Computational Intelligence (CSCI)
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Saeid Safaei, Vahid Safaei, Elizabeth D. Trippe, Karen Aguar, Hamid R. Arabnia
arXiv ID
1802.00347
Category
cs.DS: Data Structures & Algorithms
Citations
1
Venue
2017 International Conference on Computational Science and Computational Intelligence (CSCI)
Last Checked
4 months ago
Abstract
In this paper, we consider an algorithm for solving the minimum k supplier problem using the Adleman Lipton model. The procedure works in polynomial steps for the minimum k supplier problem of an undirected graph with n vertices, which is an NP hard combinatorial optimization problem.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted