提问

一直报错，可我检查没丢东西啊

2020-01-13 19:08发布

站内问答 / 文本排版
1962 2 3

The metric k-median \cite{charikar2002constant} problem is NP-hard. Given a metric space X, a group ...

The metric k-median \cite{charikar2002constant} problem is NP-hard. Given a metric space X, a group of customers $C \in X$ and a group of facilities $F \in X$, it selects open $k$ facilities in $F$ to reduce the total distance from each customer to the nearest open facilities. Considering that the metric k-median problem is given a complete graph ${G^'} = \left\langle {{V^'},{E^'}} \right\rangle$, we build the SDN-based IoT network $G = \left\langle {V \cup S \cup B,E} \right\rangle$ based on ${G^'}$, in which $V \cup S \cup B = {V^'}$, $E = {E^'}$. The BCDP is to select a suitable set of facilities in $G$ to minimize network latency and open cost, which is the same as the metric k-median problem. So the BCDP proved to be NP-hard. ![](https://pics.latexstudio.net/data/images/202001/964c07ca70c7188.png) 有没有大佬知道什么原因
2条回答
啤酒泡泡
2020-01-14 20:17
不知道你用的是什么，我随便试了一下，article文档类，xelatex引擎，直接就编译通过了。还望提供更详细的信息。

一周热门 更多>

相关问答