Efficient Approximation Algorithms for the Diameter-Bounded Max-Coverage Group Steiner Tree Problem

It contains all the data used in our experiments, including 5 real graphs (<code>MONDIAL</code>, <code>OpenCyc</code>, <code>LinkedMDB</code>, <code>YAGO</code>, and <code>DBpedia</code>) and 3 synthetic graphs (<code>LUBM-50K</code>, <code>LUBM-500K</code>, and <code>LUBM-5M</code>). Each real KG directory contains 8 files, including: <code>graph.txt</code>: The first value is the number of vertices. Then each line 'u v' means there is an undirected edge between 'u' and 'v'. <code>Weightgraph.txt</code>: The first value is the number of vertices. Then each line 'u v w' means there is an undirected edge between 'u' and 'v' weighted by 'w' which is computed by the Informativeness-based Weighting (IW) scheme. <code>nodeName.txt</code>: Mapping from vertex ID to vertex name (i.e., entity URI). <code>query.txt</code>: Each line is a keyword query containing a set of keyword names. <code>kwName.txt</code>: Mapping from keyword ID to keyword name. <code>kwMap.txt</code>: Mapping from keyword ID to vertex IDs. The first value of each line is keyword ID, and the rest are vertex IDs. <code>UWHBLL.txt</code>: The HBLL index file which was built based on the Unit Weighting. <code>IWHBLL.txt</code>: The HBLL index file which was built based on the Informativeness-based Weighting. Each synthetic directory contains 6 files, including: <code>graph.txt</code>: same as above. <code>Weightgraph.txt</code>: same as above. <code>nodeName.txt</code>: same as above. <code>queryList.txt</code>: Each line contains a set (separated by ',') of sets of vertex IDs. <code>UWHBLL.txt</code>: same as above. <code>IWHBLL.txt</code>: same as above. Apart from that, <code>Dbpedia</code> and <code>LUBM-5M</code> also contain a <code>PLLlabel.txt</code> file which was the supplementary file for the HBLL index.