{"nodes": [{"id": "0", "name": "integer programming"}, {"id": "1", "name": "hamming distance"}, {"id": "2", "name": "computational complexity"}, {"id": "3", "name": "unsplittable flow"}, {"id": "4", "name": "weighted completion"}, {"id": "5", "name": "bin packing"}, {"id": "6", "name": "hamiltonian cycle"}, {"id": "7", "name": "semidefinite programming"}, {"id": "8", "name": "complexity theory"}, {"id": "9", "name": "feedback vertex set"}, {"id": "10", "name": "longest common subsequence"}, {"id": "11", "name": "probability distribution"}, {"id": "12", "name": "local search"}, {"id": "13", "name": "vehicle routing"}, {"id": "14", "name": "hamiltonian path"}, {"id": "15", "name": "planar graph"}, {"id": "16", "name": "model checking"}, {"id": "17", "name": "oxidative stress"}, {"id": "18", "name": "approximation ratio"}, {"id": "19", "name": "turing machine"}, {"id": "20", "name": "triangle inequality"}, {"id": "21", "name": "resource allocation"}, {"id": "22", "name": "strongly connected"}, {"id": "23", "name": "truth table"}, {"id": "24", "name": "linear programming"}, {"id": "25", "name": "strip packing"}, {"id": "26", "name": "np complete"}, {"id": "27", "name": "nurse practitioners"}, {"id": "28", "name": "travelling salesman problem"}, {"id": "29", "name": "combinatorial optimization"}, {"id": "30", "name": "network design"}, {"id": "31", "name": "unit disk"}, {"id": "32", "name": "minimum spanning tree"}, {"id": "33", "name": "circuit complexity"}, {"id": "34", "name": "ant colony"}, {"id": "35", "name": "computational biology"}, {"id": "36", "name": "wiley periodicals"}, {"id": "37", "name": "black hole"}, {"id": "38", "name": "vertex cover"}, {"id": "39", "name": "np completeness"}, {"id": "40", "name": "neural networks"}, {"id": "41", "name": "maximal matching"}, {"id": "42", "name": "metric space"}, {"id": "43", "name": "shortest path"}, {"id": "44", "name": "genetic algorithm"}, {"id": "45", "name": "euclidean space"}, {"id": "46", "name": "rt pcr"}, {"id": "47", "name": "constraint satisfaction problem"}, {"id": "48", "name": "spanning tree"}, {"id": "49", "name": "ad hoc"}, {"id": "50", "name": "open shop"}, {"id": "51", "name": "graph coloring"}, {"id": "52", "name": "global optimization"}, {"id": "53", "name": "approximation algorithm"}, {"id": "54", "name": "linear program"}, {"id": "55", "name": "graph isomorphism"}], "evolve_edges": [{"2000": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 1.0, "year": 2000}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2000}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2000}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2000}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 4.0, "year": 2000}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 2.0, "year": 2000}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2000}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2000}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2000}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 1.0, "year": 2000}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2000}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 3.0, "year": 2000}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2000}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2000}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 1.0, "year": 2000}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 3.0, "year": 2000}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2000}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2000}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 1.0, "year": 2000}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 7.0, "year": 2000}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 8.0, "year": 2000}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2000}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2000}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2000}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 1.0, "year": 2000}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 1.0, "year": 2000}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 3.0, "year": 2000}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 2.0, "year": 2000}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2000}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 1.0, "year": 2000}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 1.0, "year": 2000}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2000}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 2.0, "year": 2000}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 1.0, "year": 2000}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 1.0, "year": 2000}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2000}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 3.0, "year": 2000}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2000}]}, {"2001": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 1.0, "year": 2001}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2001}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2001}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2001}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 4.0, "year": 2001}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 1.0, "year": 2001}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2001}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 2.0, "year": 2001}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2001}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2001}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 3.0, "year": 2001}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2001}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2001}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2001}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2001}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2001}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2001}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 3.0, "year": 2001}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2001}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2001}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2001}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 3.0, "year": 2001}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2001}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 3.0, "year": 2001}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2001}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2001}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 1.0, "year": 2001}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 2.0, "year": 2001}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 17.0, "year": 2001}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2001}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 1.0, "year": 2001}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 9.0, "year": 2001}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2001}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2001}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 2.0, "year": 2001}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2001}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2001}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 1.0, "year": 2001}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2001}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 3.0, "year": 2001}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 8.0, "year": 2001}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 3.0, "year": 2001}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2001}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 2.0, "year": 2001}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 2.0, "year": 2001}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2001}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 2.0, "year": 2001}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 3.0, "year": 2001}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 3.0, "year": 2001}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 7.0, "year": 2001}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2001}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 2.0, "year": 2001}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2001}]}, {"2002": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 1.0, "year": 2002}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2002}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2002}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2002}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 4.0, "year": 2002}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 2.0, "year": 2002}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2002}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2002}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 3.0, "year": 2002}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 2.0, "year": 2002}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2002}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2002}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2002}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2002}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2002}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2002}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2002}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2002}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2002}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2002}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2002}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 3.0, "year": 2002}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2002}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2002}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2002}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 3.0, "year": 2002}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2002}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 3.0, "year": 2002}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2002}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2002}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 1.0, "year": 2002}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 1.0, "year": 2002}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 2.0, "year": 2002}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 22.0, "year": 2002}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2002}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2002}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 1.0, "year": 2002}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 9.0, "year": 2002}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2002}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2002}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2002}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2002}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 3.0, "year": 2002}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2002}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 1.0, "year": 2002}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2002}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2002}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2002}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2002}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 3.0, "year": 2002}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 10.0, "year": 2002}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 4.0, "year": 2002}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2002}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 2.0, "year": 2002}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 2.0, "year": 2002}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2002}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 3.0, "year": 2002}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2002}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 4.0, "year": 2002}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 9.0, "year": 2002}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2002}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 4.0, "year": 2002}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2002}]}, {"2003": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 1.0, "year": 2003}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2003}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2003}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2003}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 4.0, "year": 2003}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 2.0, "year": 2003}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2003}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2003}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 3.0, "year": 2003}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 2.0, "year": 2003}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2003}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2003}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2003}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2003}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 1.0, "year": 2003}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 4.0, "year": 2003}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2003}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2003}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2003}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2003}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 1.0, "year": 2003}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2003}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2003}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2003}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2003}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 3.0, "year": 2003}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2003}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 1.0, "year": 2003}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2003}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2003}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2003}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 3.0, "year": 2003}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2003}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 3.0, "year": 2003}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2003}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2003}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 1.0, "year": 2003}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 1.0, "year": 2003}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 2.0, "year": 2003}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 1.0, "year": 2003}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 2.0, "year": 2003}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 30.0, "year": 2003}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2003}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2003}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 1.0, "year": 2003}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 9.0, "year": 2003}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2003}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2003}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2003}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2003}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 3.0, "year": 2003}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2003}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 1.0, "year": 2003}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2003}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2003}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2003}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2003}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 4.0, "year": 2003}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 10.0, "year": 2003}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 4.0, "year": 2003}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2003}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 2.0, "year": 2003}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 2.0, "year": 2003}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2003}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 5.0, "year": 2003}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2003}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 4.0, "year": 2003}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 10.0, "year": 2003}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2003}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2003}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 4.0, "year": 2003}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2003}]}, {"2004": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2004}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2004}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2004}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2004}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2004}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 2.0, "year": 2004}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2004}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2004}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 1.0, "year": 2004}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 5.0, "year": 2004}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 3.0, "year": 2004}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2004}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2004}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2004}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2004}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 1.0, "year": 2004}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 5.0, "year": 2004}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2004}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2004}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2004}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2004}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 1.0, "year": 2004}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2004}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2004}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2004}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 1.0, "year": 2004}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2004}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2004}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2004}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 4.0, "year": 2004}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2004}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 2.0, "year": 2004}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 2.0, "year": 2004}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2004}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2004}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2004}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 4.0, "year": 2004}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2004}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 4.0, "year": 2004}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2004}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2004}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 1.0, "year": 2004}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 1.0, "year": 2004}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 3.0, "year": 2004}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 1.0, "year": 2004}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 2.0, "year": 2004}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 38.0, "year": 2004}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2004}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2004}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 1.0, "year": 2004}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 10.0, "year": 2004}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2004}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2004}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2004}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2004}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2004}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 3.0, "year": 2004}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2004}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2004}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2004}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2004}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2004}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2004}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2004}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 1.0, "year": 2004}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 5.0, "year": 2004}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 12.0, "year": 2004}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 5.0, "year": 2004}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2004}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 3.0, "year": 2004}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 3.0, "year": 2004}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2004}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 6.0, "year": 2004}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2004}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 4.0, "year": 2004}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 13.0, "year": 2004}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2004}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2004}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 4.0, "year": 2004}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2004}]}, {"2005": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2005}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2005}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2005}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2005}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2005}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 2.0, "year": 2005}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2005}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 1.0, "year": 2005}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 5.0, "year": 2005}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 1.0, "year": 2005}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 1.0, "year": 2005}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 8.0, "year": 2005}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2005}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2005}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2005}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 1.0, "year": 2005}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 5.0, "year": 2005}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2005}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2005}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 1.0, "year": 2005}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2005}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 1.0, "year": 2005}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2005}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2005}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 2.0, "year": 2005}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2005}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2005}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 4.0, "year": 2005}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2005}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2005}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 3.0, "year": 2005}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 2.0, "year": 2005}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2005}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2005}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2005}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 4.0, "year": 2005}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2005}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 4.0, "year": 2005}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2005}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2005}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 2.0, "year": 2005}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 2.0, "year": 2005}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 4.0, "year": 2005}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 1.0, "year": 2005}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 3.0, "year": 2005}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 48.0, "year": 2005}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2005}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2005}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2005}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2005}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 11.0, "year": 2005}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2005}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2005}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2005}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2005}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 4.0, "year": 2005}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2005}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2005}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2005}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2005}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2005}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2005}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2005}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 1.0, "year": 2005}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 6.0, "year": 2005}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 13.0, "year": 2005}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 6.0, "year": 2005}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2005}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 4.0, "year": 2005}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 4.0, "year": 2005}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2005}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 7.0, "year": 2005}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2005}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 5.0, "year": 2005}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 17.0, "year": 2005}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2005}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2005}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 5.0, "year": 2005}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2005}]}, {"2006": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2006}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2006}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2006}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2006}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2006}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2006}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 3.0, "year": 2006}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2006}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 1.0, "year": 2006}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 5.0, "year": 2006}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 2.0, "year": 2006}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 2.0, "year": 2006}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 9.0, "year": 2006}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2006}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2006}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2006}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 4.0, "year": 2006}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 9.0, "year": 2006}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2006}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2006}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2006}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2006}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2006}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2006}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 1.0, "year": 2006}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2006}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2006}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2006}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 2.0, "year": 2006}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2006}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2006}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 4.0, "year": 2006}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2006}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2006}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 3.0, "year": 2006}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 2.0, "year": 2006}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2006}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2006}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2006}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 4.0, "year": 2006}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2006}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 4.0, "year": 2006}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2006}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2006}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 3.0, "year": 2006}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 3.0, "year": 2006}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 4.0, "year": 2006}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 1.0, "year": 2006}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2006}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 3.0, "year": 2006}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 65.0, "year": 2006}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2006}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2006}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2006}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2006}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 11.0, "year": 2006}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2006}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2006}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2006}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2006}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 6.0, "year": 2006}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2006}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2006}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2006}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2006}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2006}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2006}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2006}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 1.0, "year": 2006}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 6.0, "year": 2006}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 15.0, "year": 2006}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 8.0, "year": 2006}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 3.0, "year": 2006}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2006}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 4.0, "year": 2006}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 4.0, "year": 2006}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2006}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 7.0, "year": 2006}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2006}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 5.0, "year": 2006}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2006}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2006}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 17.0, "year": 2006}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2006}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2006}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2006}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 5.0, "year": 2006}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2006}]}, {"2007": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2007}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2007}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2007}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2007}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2007}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2007}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 5.0, "year": 2007}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 1.0, "year": 2007}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 1.0, "year": 2007}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 1.0, "year": 2007}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2007}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 1.0, "year": 2007}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 6.0, "year": 2007}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 2.0, "year": 2007}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 2.0, "year": 2007}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 9.0, "year": 2007}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2007}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2007}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2007}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 4.0, "year": 2007}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 9.0, "year": 2007}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2007}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2007}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2007}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2007}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2007}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2007}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 2.0, "year": 2007}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2007}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2007}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 2.0, "year": 2007}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2007}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2007}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 4.0, "year": 2007}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2007}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2007}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 3.0, "year": 2007}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 2.0, "year": 2007}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2007}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2007}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2007}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 5.0, "year": 2007}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2007}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 7.0, "year": 2007}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2007}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2007}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 4.0, "year": 2007}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 3.0, "year": 2007}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 6.0, "year": 2007}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 2.0, "year": 2007}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 2.0, "year": 2007}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 3.0, "year": 2007}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 79.0, "year": 2007}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2007}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2007}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2007}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2007}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 13.0, "year": 2007}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2007}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2007}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2007}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 1.0, "year": 2007}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 5.0, "year": 2007}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 7.0, "year": 2007}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2007}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2007}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2007}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2007}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2007}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 1.0, "year": 2007}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2007}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2007}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 1.0, "year": 2007}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 6.0, "year": 2007}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 17.0, "year": 2007}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2007}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 9.0, "year": 2007}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 3.0, "year": 2007}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2007}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 4.0, "year": 2007}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 4.0, "year": 2007}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2007}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 10.0, "year": 2007}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 1.0, "year": 2007}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2007}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 5.0, "year": 2007}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 4.0, "year": 2007}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 18.0, "year": 2007}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2007}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2007}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 6.0, "year": 2007}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2007}]}, {"2008": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2008}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2008}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2008}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2008}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2008}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2008}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 5.0, "year": 2008}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 1.0, "year": 2008}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 1.0, "year": 2008}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 1.0, "year": 2008}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2008}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 1.0, "year": 2008}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 6.0, "year": 2008}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 2.0, "year": 2008}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 2.0, "year": 2008}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 9.0, "year": 2008}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2008}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2008}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2008}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 4.0, "year": 2008}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 9.0, "year": 2008}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2008}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2008}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2008}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2008}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2008}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 3.0, "year": 2008}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2008}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 2.0, "year": 2008}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2008}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 2.0, "year": 2008}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2008}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 1.0, "year": 2008}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 3.0, "year": 2008}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2008}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 1.0, "year": 2008}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2008}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 6.0, "year": 2008}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2008}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2008}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 1.0, "year": 2008}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 3.0, "year": 2008}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 2.0, "year": 2008}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2008}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2008}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2008}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 5.0, "year": 2008}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2008}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 7.0, "year": 2008}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2008}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2008}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 5.0, "year": 2008}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 3.0, "year": 2008}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 6.0, "year": 2008}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 3.0, "year": 2008}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2008}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 2.0, "year": 2008}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 3.0, "year": 2008}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2008}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 86.0, "year": 2008}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2008}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2008}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2008}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2008}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 13.0, "year": 2008}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2008}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2008}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2008}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 1.0, "year": 2008}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 5.0, "year": 2008}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 8.0, "year": 2008}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2008}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2008}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2008}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2008}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 1.0, "year": 2008}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2008}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2008}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 1.0, "year": 2008}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2008}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2008}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2008}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 2.0, "year": 2008}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2008}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 19.0, "year": 2008}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2008}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2008}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 11.0, "year": 2008}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2008}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 6.0, "year": 2008}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2008}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 4.0, "year": 2008}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 4.0, "year": 2008}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2008}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 4.0, "year": 2008}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2008}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2008}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 11.0, "year": 2008}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 1.0, "year": 2008}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2008}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 5.0, "year": 2008}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 3.0, "year": 2008}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 4.0, "year": 2008}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 20.0, "year": 2008}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2008}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2008}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2008}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 7.0, "year": 2008}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2008}]}, {"2009": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2009}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2009}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2009}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2009}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2009}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2009}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 6.0, "year": 2009}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 1.0, "year": 2009}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 1.0, "year": 2009}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 1.0, "year": 2009}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2009}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 1.0, "year": 2009}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 7.0, "year": 2009}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 2.0, "year": 2009}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2009}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2009}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2009}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 10.0, "year": 2009}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2009}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 4.0, "year": 2009}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 1.0, "year": 2009}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2009}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2009}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 7.0, "year": 2009}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2009}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 1.0, "year": 2009}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2009}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2009}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2009}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2009}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2009}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2009}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2009}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2009}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2009}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 2.0, "year": 2009}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 3.0, "year": 2009}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2009}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 3.0, "year": 2009}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2009}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2009}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2009}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2009}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2009}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2009}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2009}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2009}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2009}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 9.0, "year": 2009}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 5.0, "year": 2009}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2009}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2009}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2009}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2009}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2009}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2009}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2009}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2009}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2009}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2009}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 9.0, "year": 2009}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2009}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 7.0, "year": 2009}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2009}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2009}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2009}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2009}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 5.0, "year": 2009}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 3.0, "year": 2009}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 6.0, "year": 2009}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 4.0, "year": 2009}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2009}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2009}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 2.0, "year": 2009}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 4.0, "year": 2009}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2009}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 98.0, "year": 2009}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 2.0, "year": 2009}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 2.0, "year": 2009}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2009}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2009}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2009}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2009}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 14.0, "year": 2009}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2009}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2009}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 3.0, "year": 2009}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2009}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 1.0, "year": 2009}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2009}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2009}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 9.0, "year": 2009}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2009}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2009}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2009}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2009}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2009}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2009}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 1.0, "year": 2009}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2009}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2009}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 1.0, "year": 2009}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2009}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2009}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2009}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 2.0, "year": 2009}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2009}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2009}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 21.0, "year": 2009}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2009}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2009}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2009}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 12.0, "year": 2009}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2009}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 7.0, "year": 2009}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2009}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 5.0, "year": 2009}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 5.0, "year": 2009}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2009}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2009}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2009}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 3.0, "year": 2009}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2009}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2009}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 13.0, "year": 2009}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2009}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2009}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 6.0, "year": 2009}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 4.0, "year": 2009}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 5.0, "year": 2009}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 22.0, "year": 2009}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2009}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 2.0, "year": 2009}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2009}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 9.0, "year": 2009}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2009}]}, {"2010": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2010}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2010}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2010}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2010}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2010}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2010}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 6.0, "year": 2010}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 2.0, "year": 2010}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 1.0, "year": 2010}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2010}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2010}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2010}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2010}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 8.0, "year": 2010}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 2.0, "year": 2010}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2010}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2010}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2010}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 10.0, "year": 2010}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2010}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2010}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2010}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2010}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 1.0, "year": 2010}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2010}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2010}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 7.0, "year": 2010}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2010}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2010}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 1.0, "year": 2010}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2010}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2010}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2010}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2010}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2010}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2010}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2010}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2010}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 4.0, "year": 2010}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2010}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 2.0, "year": 2010}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 3.0, "year": 2010}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2010}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 3.0, "year": 2010}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 2.0, "year": 2010}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2010}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2010}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2010}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2010}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2010}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2010}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2010}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2010}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2010}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2010}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 9.0, "year": 2010}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 1.0, "year": 2010}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 1.0, "year": 2010}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 6.0, "year": 2010}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2010}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2010}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2010}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2010}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2010}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2010}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2010}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2010}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2010}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2010}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2010}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 10.0, "year": 2010}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2010}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 7.0, "year": 2010}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2010}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2010}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2010}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2010}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2010}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 5.0, "year": 2010}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2010}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 7.0, "year": 2010}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 4.0, "year": 2010}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2010}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2010}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 2.0, "year": 2010}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 5.0, "year": 2010}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2010}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 109.0, "year": 2010}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 2.0, "year": 2010}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 3.0, "year": 2010}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2010}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2010}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2010}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2010}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 15.0, "year": 2010}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2010}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 2.0, "year": 2010}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2010}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2010}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 4.0, "year": 2010}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2010}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 1.0, "year": 2010}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2010}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2010}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 9.0, "year": 2010}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 12.0, "year": 2010}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2010}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2010}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2010}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2010}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2010}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2010}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2010}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 1.0, "year": 2010}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2010}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2010}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2010}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2010}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2010}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2010}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 2.0, "year": 2010}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2010}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2010}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 22.0, "year": 2010}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2010}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2010}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2010}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2010}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 12.0, "year": 2010}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2010}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 8.0, "year": 2010}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2010}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 6.0, "year": 2010}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 6.0, "year": 2010}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2010}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2010}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2010}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2010}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2010}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 4.0, "year": 2010}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2010}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2010}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2010}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 15.0, "year": 2010}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 1.0, "year": 2010}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2010}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2010}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 6.0, "year": 2010}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 4.0, "year": 2010}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 6.0, "year": 2010}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 24.0, "year": 2010}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2010}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 3.0, "year": 2010}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2010}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 12.0, "year": 2010}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2010}]}, {"2011": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2011}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2011}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2011}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 5.0, "year": 2011}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2011}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2011}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 5.0, "year": 2011}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 7.0, "year": 2011}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 4.0, "year": 2011}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 1.0, "year": 2011}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2011}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2011}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2011}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2011}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2011}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 9.0, "year": 2011}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2011}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 2.0, "year": 2011}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2011}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2011}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2011}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2011}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 13.0, "year": 2011}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2011}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2011}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2011}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2011}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2011}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 1.0, "year": 2011}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2011}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2011}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 7.0, "year": 2011}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2011}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2011}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 1.0, "year": 2011}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2011}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2011}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2011}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2011}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2011}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2011}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2011}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2011}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2011}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2011}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2011}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2011}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 2.0, "year": 2011}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2011}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 4.0, "year": 2011}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2011}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 3.0, "year": 2011}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 2.0, "year": 2011}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2011}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2011}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2011}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2011}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2011}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2011}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2011}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2011}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2011}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2011}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2011}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2011}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 10.0, "year": 2011}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 1.0, "year": 2011}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 1.0, "year": 2011}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 6.0, "year": 2011}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2011}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2011}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2011}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2011}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2011}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2011}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2011}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2011}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2011}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2011}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2011}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 11.0, "year": 2011}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2011}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 7.0, "year": 2011}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2011}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2011}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2011}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2011}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2011}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2011}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2011}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2011}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 8.0, "year": 2011}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 4.0, "year": 2011}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2011}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2011}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 3.0, "year": 2011}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 5.0, "year": 2011}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2011}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 120.0, "year": 2011}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 3.0, "year": 2011}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 3.0, "year": 2011}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2011}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2011}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2011}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2011}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 15.0, "year": 2011}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2011}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 4.0, "year": 2011}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2011}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2011}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 4.0, "year": 2011}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2011}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 1.0, "year": 2011}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2011}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2011}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 10.0, "year": 2011}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 14.0, "year": 2011}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2011}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2011}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2011}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2011}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2011}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2011}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2011}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 1.0, "year": 2011}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 1.0, "year": 2011}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2011}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2011}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2011}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2011}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2011}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 2.0, "year": 2011}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2011}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2011}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 23.0, "year": 2011}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2011}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2011}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2011}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2011}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 16.0, "year": 2011}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2011}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 9.0, "year": 2011}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2011}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 7.0, "year": 2011}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 7.0, "year": 2011}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2011}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2011}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2011}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2011}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2011}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 4.0, "year": 2011}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2011}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2011}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2011}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 17.0, "year": 2011}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 2.0, "year": 2011}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2011}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2011}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 6.0, "year": 2011}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 4.0, "year": 2011}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 7.0, "year": 2011}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 26.0, "year": 2011}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2011}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 3.0, "year": 2011}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 1.0, "year": 2011}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 14.0, "year": 2011}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2011}]}, {"2012": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2012}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2012}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2012}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 5.0, "year": 2012}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2012}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2012}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 6.0, "year": 2012}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 8.0, "year": 2012}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 4.0, "year": 2012}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 2.0, "year": 2012}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2012}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 1.0, "year": 2012}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2012}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2012}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2012}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2012}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 10.0, "year": 2012}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2012}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 2.0, "year": 2012}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2012}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2012}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2012}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 13.0, "year": 2012}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2012}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2012}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2012}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2012}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2012}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2012}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 7.0, "year": 2012}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2012}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2012}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2012}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2012}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2012}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2012}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2012}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2012}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2012}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2012}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2012}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2012}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2012}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2012}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2012}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2012}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2012}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 4.0, "year": 2012}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2012}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2012}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 3.0, "year": 2012}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2012}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2012}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2012}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2012}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2012}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2012}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2012}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2012}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2012}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2012}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2012}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 10.0, "year": 2012}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2012}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2012}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 1.0, "year": 2012}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 8.0, "year": 2012}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2012}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2012}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2012}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2012}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2012}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2012}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2012}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2012}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2012}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2012}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 12.0, "year": 2012}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2012}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2012}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2012}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2012}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2012}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2012}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 5.0, "year": 2012}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2012}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2012}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 8.0, "year": 2012}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 4.0, "year": 2012}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2012}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2012}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2012}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 5.0, "year": 2012}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2012}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 125.0, "year": 2012}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 3.0, "year": 2012}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2012}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2012}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2012}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2012}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2012}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2012}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2012}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 17.0, "year": 2012}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2012}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 6.0, "year": 2012}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2012}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 4.0, "year": 2012}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2012}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 1.0, "year": 2012}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2012}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2012}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 11.0, "year": 2012}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 17.0, "year": 2012}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2012}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2012}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2012}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2012}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2012}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2012}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2012}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2012}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2012}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2012}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2012}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2012}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 2.0, "year": 2012}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2012}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2012}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 25.0, "year": 2012}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2012}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2012}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2012}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 17.0, "year": 2012}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2012}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2012}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 10.0, "year": 2012}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2012}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 8.0, "year": 2012}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 8.0, "year": 2012}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2012}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2012}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2012}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2012}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2012}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 5.0, "year": 2012}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2012}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2012}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2012}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 17.0, "year": 2012}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 2.0, "year": 2012}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 1.0, "year": 2012}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2012}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2012}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 7.0, "year": 2012}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 4.0, "year": 2012}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 2.0, "year": 2012}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2012}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 27.0, "year": 2012}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 3.0, "year": 2012}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2012}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 1.0, "year": 2012}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 15.0, "year": 2012}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2012}]}, {"2013": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2013}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2013}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2013}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 5.0, "year": 2013}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2013}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2013}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 7.0, "year": 2013}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 9.0, "year": 2013}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2013}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 4.0, "year": 2013}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 3.0, "year": 2013}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2013}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 1.0, "year": 2013}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2013}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2013}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2013}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2013}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 10.0, "year": 2013}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2013}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 2.0, "year": 2013}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2013}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2013}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2013}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 13.0, "year": 2013}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2013}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2013}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2013}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2013}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2013}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2013}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 7.0, "year": 2013}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2013}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2013}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2013}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2013}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2013}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2013}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2013}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2013}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2013}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2013}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2013}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2013}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2013}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2013}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2013}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2013}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2013}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 4.0, "year": 2013}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2013}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2013}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 3.0, "year": 2013}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2013}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2013}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2013}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2013}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2013}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2013}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2013}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2013}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2013}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2013}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2013}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 10.0, "year": 2013}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2013}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2013}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 1.0, "year": 2013}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 8.0, "year": 2013}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2013}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2013}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2013}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2013}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2013}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2013}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2013}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2013}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2013}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 1.0, "year": 2013}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2013}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 15.0, "year": 2013}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2013}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2013}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2013}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2013}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2013}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2013}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 5.0, "year": 2013}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2013}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2013}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 9.0, "year": 2013}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 4.0, "year": 2013}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2013}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2013}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2013}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 5.0, "year": 2013}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2013}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 130.0, "year": 2013}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 3.0, "year": 2013}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2013}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2013}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2013}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2013}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2013}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2013}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2013}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 17.0, "year": 2013}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2013}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 7.0, "year": 2013}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2013}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2013}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2013}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2013}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 2.0, "year": 2013}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2013}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2013}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 12.0, "year": 2013}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 18.0, "year": 2013}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2013}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2013}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2013}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 2.0, "year": 2013}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2013}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2013}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2013}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2013}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2013}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2013}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2013}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2013}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 4.0, "year": 2013}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 3.0, "year": 2013}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2013}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 1.0, "year": 2013}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 29.0, "year": 2013}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2013}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2013}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2013}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 17.0, "year": 2013}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2013}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2013}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 11.0, "year": 2013}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2013}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 9.0, "year": 2013}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 8.0, "year": 2013}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2013}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2013}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2013}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2013}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2013}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 5.0, "year": 2013}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2013}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2013}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2013}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 19.0, "year": 2013}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 3.0, "year": 2013}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2013}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2013}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2013}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 8.0, "year": 2013}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 1.0, "year": 2013}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 8.0, "year": 2013}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 2.0, "year": 2013}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2013}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 27.0, "year": 2013}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 4.0, "year": 2013}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2013}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 1.0, "year": 2013}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 16.0, "year": 2013}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 1.0, "year": 2013}]}, {"2014": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2014}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2014}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2014}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2014}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 1.0, "year": 2014}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2014}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2014}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2014}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2014}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 9.0, "year": 2014}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2014}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 4.0, "year": 2014}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 3.0, "year": 2014}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2014}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 2.0, "year": 2014}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 1.0, "year": 2014}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2014}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2014}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2014}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2014}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 11.0, "year": 2014}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 2.0, "year": 2014}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2014}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2014}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2014}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2014}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2014}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2014}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2014}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2014}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2014}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2014}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2014}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 7.0, "year": 2014}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2014}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2014}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2014}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2014}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2014}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2014}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2014}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2014}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2014}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2014}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2014}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2014}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2014}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2014}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2014}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2014}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2014}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 5.0, "year": 2014}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2014}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2014}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 3.0, "year": 2014}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2014}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2014}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2014}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2014}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2014}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2014}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2014}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2014}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2014}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2014}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2014}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2014}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 10.0, "year": 2014}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2014}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2014}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 1.0, "year": 2014}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 9.0, "year": 2014}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2014}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2014}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2014}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2014}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2014}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2014}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2014}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2014}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2014}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2014}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 16.0, "year": 2014}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2014}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2014}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2014}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2014}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2014}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2014}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 6.0, "year": 2014}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2014}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2014}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 9.0, "year": 2014}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 4.0, "year": 2014}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2014}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2014}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 5.0, "year": 2014}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2014}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 137.0, "year": 2014}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 3.0, "year": 2014}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2014}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2014}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2014}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2014}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2014}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2014}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2014}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 17.0, "year": 2014}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2014}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2014}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2014}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2014}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2014}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2014}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2014}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2014}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 2.0, "year": 2014}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2014}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2014}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2014}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2014}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 14.0, "year": 2014}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 23.0, "year": 2014}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2014}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2014}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2014}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2014}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2014}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2014}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 3.0, "year": 2014}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2014}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2014}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2014}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2014}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2014}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 1.0, "year": 2014}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 2.0, "year": 2014}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2014}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 4.0, "year": 2014}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 3.0, "year": 2014}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2014}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 1.0, "year": 2014}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 31.0, "year": 2014}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2014}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2014}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 17.0, "year": 2014}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2014}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 1.0, "year": 2014}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2014}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 12.0, "year": 2014}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2014}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 9.0, "year": 2014}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 8.0, "year": 2014}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2014}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2014}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2014}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2014}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2014}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 5.0, "year": 2014}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2014}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2014}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2014}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 19.0, "year": 2014}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 3.0, "year": 2014}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2014}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2014}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2014}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 8.0, "year": 2014}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 1.0, "year": 2014}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 10.0, "year": 2014}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 2.0, "year": 2014}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2014}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2014}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 28.0, "year": 2014}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 4.0, "year": 2014}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2014}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2014}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 2.0, "year": 2014}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 18.0, "year": 2014}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2014}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2014}]}, {"2015": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2015}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2015}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2015}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2015}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2015}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2015}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2015}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2015}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2015}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 9.0, "year": 2015}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2015}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 4.0, "year": 2015}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 3.0, "year": 2015}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2015}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 2.0, "year": 2015}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 1.0, "year": 2015}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2015}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2015}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2015}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2015}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 12.0, "year": 2015}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 2.0, "year": 2015}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2015}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2015}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2015}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2015}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2015}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2015}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2015}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2015}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2015}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2015}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 12.0, "year": 2015}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 3.0, "year": 2015}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2015}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 20.0, "year": 2015}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2015}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2015}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2015}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2015}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2015}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2015}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2015}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2015}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2015}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2015}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2015}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2015}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2015}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2015}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2015}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2015}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 3.0, "year": 2015}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2015}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2015}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2015}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2015}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2015}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2015}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2015}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2015}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2015}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2015}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2015}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2015}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 10.0, "year": 2015}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2015}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2015}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 1.0, "year": 2015}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 1.0, "year": 2015}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 9.0, "year": 2015}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 1.0, "year": 2015}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2015}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2015}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2015}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2015}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2015}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2015}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2015}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2015}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 16.0, "year": 2015}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2015}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2015}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2015}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2015}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2015}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2015}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 7.0, "year": 2015}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2015}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2015}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2015}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 10.0, "year": 2015}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2015}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 1.0, "year": 2015}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2015}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 5.0, "year": 2015}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2015}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 150.0, "year": 2015}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 3.0, "year": 2015}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2015}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2015}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2015}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2015}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2015}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2015}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2015}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 18.0, "year": 2015}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2015}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2015}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2015}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2015}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2015}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2015}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2015}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2015}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2015}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2015}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 4.0, "year": 2015}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2015}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2015}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2015}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2015}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 16.0, "year": 2015}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 25.0, "year": 2015}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2015}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 3.0, "year": 2015}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2015}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2015}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2015}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2015}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2015}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2015}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2015}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2015}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2015}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2015}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2015}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2015}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 4.0, "year": 2015}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2015}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 6.0, "year": 2015}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 4.0, "year": 2015}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2015}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 2.0, "year": 2015}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 36.0, "year": 2015}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 3.0, "year": 2015}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2015}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2015}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 18.0, "year": 2015}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2015}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2015}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2015}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 13.0, "year": 2015}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2015}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 9.0, "year": 2015}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 8.0, "year": 2015}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2015}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2015}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2015}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2015}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2015}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2015}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2015}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 24.0, "year": 2015}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 5.0, "year": 2015}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2015}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2015}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2015}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 8.0, "year": 2015}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 2.0, "year": 2015}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 12.0, "year": 2015}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 3.0, "year": 2015}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2015}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2015}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 29.0, "year": 2015}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 5.0, "year": 2015}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2015}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2015}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 2.0, "year": 2015}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 20.0, "year": 2015}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2015}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2015}]}, {"2016": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2016}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2016}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2016}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2016}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2016}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2016}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2016}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2016}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2016}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 9.0, "year": 2016}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2016}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 4.0, "year": 2016}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 3.0, "year": 2016}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2016}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 2.0, "year": 2016}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 1.0, "year": 2016}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2016}, {"source": "2", "target": "33", "source_name": "computational complexity", "target_name": "circuit complexity", "weight": 1.0, "year": 2016}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2016}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 1.0, "year": 2016}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2016}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 12.0, "year": 2016}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 2.0, "year": 2016}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2016}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2016}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2016}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2016}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2016}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2016}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2016}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2016}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2016}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2016}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2016}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 13.0, "year": 2016}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 5.0, "year": 2016}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2016}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 23.0, "year": 2016}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2016}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2016}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2016}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 1.0, "year": 2016}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2016}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2016}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2016}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2016}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2016}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2016}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2016}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2016}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2016}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2016}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2016}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 5.0, "year": 2016}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2016}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2016}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2016}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 3.0, "year": 2016}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2016}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2016}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2016}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 4.0, "year": 2016}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2016}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2016}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2016}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2016}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2016}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2016}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2016}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2016}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 10.0, "year": 2016}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2016}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2016}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 5.0, "year": 2016}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 2.0, "year": 2016}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 13.0, "year": 2016}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 2.0, "year": 2016}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2016}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2016}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2016}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 6.0, "year": 2016}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2016}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2016}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2016}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2016}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 2.0, "year": 2016}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2016}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 17.0, "year": 2016}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2016}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2016}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2016}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2016}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2016}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2016}, {"source": "18", "target": "28", "source_name": "approximation ratio", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2016}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 9.0, "year": 2016}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2016}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2016}, {"source": "18", "target": "32", "source_name": "approximation ratio", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2016}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2016}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 10.0, "year": 2016}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2016}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 2.0, "year": 2016}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2016}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 6.0, "year": 2016}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2016}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 160.0, "year": 2016}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 3.0, "year": 2016}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2016}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2016}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2016}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2016}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2016}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2016}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2016}, {"source": "20", "target": "36", "source_name": "triangle inequality", "target_name": "wiley periodicals", "weight": 1.0, "year": 2016}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 2.0, "year": 2016}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 19.0, "year": 2016}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2016}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2016}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2016}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2016}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2016}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2016}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2016}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2016}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2016}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2016}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2016}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 4.0, "year": 2016}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2016}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2016}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2016}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2016}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 16.0, "year": 2016}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 25.0, "year": 2016}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2016}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 6.0, "year": 2016}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2016}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2016}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2016}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2016}, {"source": "26", "target": "45", "source_name": "np complete", "target_name": "euclidean space", "weight": 1.0, "year": 2016}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2016}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2016}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2016}, {"source": "28", "target": "42", "source_name": "travelling salesman problem", "target_name": "metric space", "weight": 1.0, "year": 2016}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2016}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2016}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2016}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2016}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2016}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2016}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 4.0, "year": 2016}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2016}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 7.0, "year": 2016}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 4.0, "year": 2016}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2016}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 3.0, "year": 2016}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 39.0, "year": 2016}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 3.0, "year": 2016}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2016}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2016}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 18.0, "year": 2016}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2016}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2016}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2016}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 13.0, "year": 2016}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2016}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 10.0, "year": 2016}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 9.0, "year": 2016}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2016}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2016}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2016}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2016}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2016}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2016}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 6.0, "year": 2016}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2016}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2016}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2016}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 24.0, "year": 2016}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 5.0, "year": 2016}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2016}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2016}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2016}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 13.0, "year": 2016}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 3.0, "year": 2016}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 15.0, "year": 2016}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 3.0, "year": 2016}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2016}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2016}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 31.0, "year": 2016}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2016}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 6.0, "year": 2016}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2016}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2016}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 2.0, "year": 2016}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 20.0, "year": 2016}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2016}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2016}]}, {"2017": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2017}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2017}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2017}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2017}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2017}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2017}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2017}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2017}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2017}, {"source": "2", "target": "5", "source_name": "computational complexity", "target_name": "bin packing", "weight": 1.0, "year": 2017}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 9.0, "year": 2017}, {"source": "2", "target": "12", "source_name": "computational complexity", "target_name": "local search", "weight": 1.0, "year": 2017}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2017}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 7.0, "year": 2017}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 4.0, "year": 2017}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2017}, {"source": "2", "target": "23", "source_name": "computational complexity", "target_name": "truth table", "weight": 1.0, "year": 2017}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 2.0, "year": 2017}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 1.0, "year": 2017}, {"source": "2", "target": "28", "source_name": "computational complexity", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2017}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2017}, {"source": "2", "target": "33", "source_name": "computational complexity", "target_name": "circuit complexity", "weight": 1.0, "year": 2017}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2017}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 2.0, "year": 2017}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2017}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 16.0, "year": 2017}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 2.0, "year": 2017}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2017}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2017}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2017}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2017}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2017}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2017}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2017}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2017}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2017}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2017}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2017}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 14.0, "year": 2017}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 2.0, "year": 2017}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 5.0, "year": 2017}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2017}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 24.0, "year": 2017}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2017}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2017}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2017}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 2.0, "year": 2017}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2017}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2017}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2017}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2017}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2017}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2017}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 6.0, "year": 2017}, {"source": "8", "target": "10", "source_name": "complexity theory", "target_name": "longest common subsequence", "weight": 1.0, "year": 2017}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2017}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2017}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2017}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2017}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 6.0, "year": 2017}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2017}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2017}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2017}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 4.0, "year": 2017}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2017}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2017}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2017}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 5.0, "year": 2017}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2017}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2017}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2017}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2017}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2017}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2017}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2017}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2017}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 11.0, "year": 2017}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2017}, {"source": "13", "target": "29", "source_name": "vehicle routing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2017}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 5.0, "year": 2017}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 3.0, "year": 2017}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 14.0, "year": 2017}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 3.0, "year": 2017}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2017}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2017}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2017}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 7.0, "year": 2017}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2017}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2017}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2017}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2017}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 2.0, "year": 2017}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2017}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 17.0, "year": 2017}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2017}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2017}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2017}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2017}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2017}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2017}, {"source": "18", "target": "28", "source_name": "approximation ratio", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2017}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 10.0, "year": 2017}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2017}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2017}, {"source": "18", "target": "32", "source_name": "approximation ratio", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2017}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2017}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 10.0, "year": 2017}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2017}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 2.0, "year": 2017}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2017}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 6.0, "year": 2017}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2017}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 173.0, "year": 2017}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 4.0, "year": 2017}, {"source": "19", "target": "23", "source_name": "turing machine", "target_name": "truth table", "weight": 1.0, "year": 2017}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2017}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2017}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2017}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2017}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "20", "target": "24", "source_name": "triangle inequality", "target_name": "linear programming", "weight": 1.0, "year": 2017}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2017}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2017}, {"source": "20", "target": "36", "source_name": "triangle inequality", "target_name": "wiley periodicals", "weight": 1.0, "year": 2017}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 3.0, "year": 2017}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 22.0, "year": 2017}, {"source": "20", "target": "54", "source_name": "triangle inequality", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2017}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2017}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2017}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2017}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2017}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2017}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2017}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2017}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2017}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 3.0, "year": 2017}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2017}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 4.0, "year": 2017}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2017}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2017}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2017}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2017}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 18.0, "year": 2017}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 28.0, "year": 2017}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2017}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 7.0, "year": 2017}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2017}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2017}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2017}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2017}, {"source": "26", "target": "45", "source_name": "np complete", "target_name": "euclidean space", "weight": 1.0, "year": 2017}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2017}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2017}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2017}, {"source": "28", "target": "40", "source_name": "travelling salesman problem", "target_name": "neural networks", "weight": 1.0, "year": 2017}, {"source": "28", "target": "42", "source_name": "travelling salesman problem", "target_name": "metric space", "weight": 1.0, "year": 2017}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2017}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2017}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2017}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2017}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 2.0, "year": 2017}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2017}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 4.0, "year": 2017}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2017}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 7.0, "year": 2017}, {"source": "29", "target": "45", "source_name": "combinatorial optimization", "target_name": "euclidean space", "weight": 1.0, "year": 2017}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 4.0, "year": 2017}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2017}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 3.0, "year": 2017}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 41.0, "year": 2017}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 3.0, "year": 2017}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2017}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2017}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 19.0, "year": 2017}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2017}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2017}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2017}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 14.0, "year": 2017}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2017}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 10.0, "year": 2017}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 9.0, "year": 2017}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2017}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 1.0, "year": 2017}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2017}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2017}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2017}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2017}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 6.0, "year": 2017}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2017}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2017}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2017}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 24.0, "year": 2017}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 5.0, "year": 2017}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2017}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2017}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2017}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 13.0, "year": 2017}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 3.0, "year": 2017}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 15.0, "year": 2017}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 4.0, "year": 2017}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2017}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2017}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 32.0, "year": 2017}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2017}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 7.0, "year": 2017}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2017}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2017}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 2.0, "year": 2017}, {"source": "52", "target": "55", "source_name": "global optimization", "target_name": "graph isomorphism", "weight": 1.0, "year": 2017}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 22.0, "year": 2017}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2017}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2017}]}, {"2018": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2018}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2018}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2018}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2018}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2018}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 2.0, "year": 2018}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 10.0, "year": 2018}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2018}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2018}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2018}, {"source": "2", "target": "5", "source_name": "computational complexity", "target_name": "bin packing", "weight": 1.0, "year": 2018}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 10.0, "year": 2018}, {"source": "2", "target": "12", "source_name": "computational complexity", "target_name": "local search", "weight": 1.0, "year": 2018}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2018}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 7.0, "year": 2018}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 4.0, "year": 2018}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2018}, {"source": "2", "target": "23", "source_name": "computational complexity", "target_name": "truth table", "weight": 1.0, "year": 2018}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 2.0, "year": 2018}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 2.0, "year": 2018}, {"source": "2", "target": "28", "source_name": "computational complexity", "target_name": "travelling salesman problem", "weight": 3.0, "year": 2018}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2018}, {"source": "2", "target": "33", "source_name": "computational complexity", "target_name": "circuit complexity", "weight": 1.0, "year": 2018}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2018}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 2.0, "year": 2018}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2018}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 16.0, "year": 2018}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 2.0, "year": 2018}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2018}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2018}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2018}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2018}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2018}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2018}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2018}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2018}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2018}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2018}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2018}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2018}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 14.0, "year": 2018}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 2.0, "year": 2018}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 6.0, "year": 2018}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2018}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 25.0, "year": 2018}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2018}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2018}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2018}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 2.0, "year": 2018}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2018}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2018}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2018}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2018}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2018}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2018}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 9.0, "year": 2018}, {"source": "8", "target": "10", "source_name": "complexity theory", "target_name": "longest common subsequence", "weight": 1.0, "year": 2018}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2018}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2018}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2018}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2018}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 6.0, "year": 2018}, {"source": "8", "target": "55", "source_name": "complexity theory", "target_name": "graph isomorphism", "weight": 3.0, "year": 2018}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2018}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2018}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2018}, {"source": "10", "target": "33", "source_name": "longest common subsequence", "target_name": "circuit complexity", "weight": 1.0, "year": 2018}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 5.0, "year": 2018}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2018}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 2.0, "year": 2018}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2018}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 5.0, "year": 2018}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2018}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2018}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2018}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2018}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2018}, {"source": "12", "target": "34", "source_name": "local search", "target_name": "ant colony", "weight": 1.0, "year": 2018}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2018}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2018}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2018}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 14.0, "year": 2018}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2018}, {"source": "13", "target": "29", "source_name": "vehicle routing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2018}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 5.0, "year": 2018}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2018}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 3.0, "year": 2018}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 14.0, "year": 2018}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 3.0, "year": 2018}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2018}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2018}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2018}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 7.0, "year": 2018}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2018}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2018}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2018}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2018}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 2.0, "year": 2018}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2018}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 18.0, "year": 2018}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2018}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2018}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2018}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2018}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 3.0, "year": 2018}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2018}, {"source": "18", "target": "28", "source_name": "approximation ratio", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2018}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 11.0, "year": 2018}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2018}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2018}, {"source": "18", "target": "32", "source_name": "approximation ratio", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2018}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2018}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 10.0, "year": 2018}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2018}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 2.0, "year": 2018}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 1.0, "year": 2018}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2018}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 6.0, "year": 2018}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2018}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 177.0, "year": 2018}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 5.0, "year": 2018}, {"source": "19", "target": "23", "source_name": "turing machine", "target_name": "truth table", "weight": 1.0, "year": 2018}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2018}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2018}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2018}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2018}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "20", "target": "24", "source_name": "triangle inequality", "target_name": "linear programming", "weight": 1.0, "year": 2018}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2018}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2018}, {"source": "20", "target": "36", "source_name": "triangle inequality", "target_name": "wiley periodicals", "weight": 1.0, "year": 2018}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 4.0, "year": 2018}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 23.0, "year": 2018}, {"source": "20", "target": "54", "source_name": "triangle inequality", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2018}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2018}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2018}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2018}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2018}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2018}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2018}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2018}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2018}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2018}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2018}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 5.0, "year": 2018}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2018}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2018}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2018}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2018}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 19.0, "year": 2018}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 29.0, "year": 2018}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2018}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 8.0, "year": 2018}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2018}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2018}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2018}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2018}, {"source": "26", "target": "45", "source_name": "np complete", "target_name": "euclidean space", "weight": 1.0, "year": 2018}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2018}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2018}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2018}, {"source": "28", "target": "40", "source_name": "travelling salesman problem", "target_name": "neural networks", "weight": 1.0, "year": 2018}, {"source": "28", "target": "42", "source_name": "travelling salesman problem", "target_name": "metric space", "weight": 1.0, "year": 2018}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2018}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2018}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2018}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2018}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2018}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 3.0, "year": 2018}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2018}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 5.0, "year": 2018}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2018}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 7.0, "year": 2018}, {"source": "29", "target": "45", "source_name": "combinatorial optimization", "target_name": "euclidean space", "weight": 1.0, "year": 2018}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 4.0, "year": 2018}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2018}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 3.0, "year": 2018}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 43.0, "year": 2018}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 4.0, "year": 2018}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2018}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2018}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2018}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 19.0, "year": 2018}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2018}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2018}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2018}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 14.0, "year": 2018}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2018}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 10.0, "year": 2018}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 9.0, "year": 2018}, {"source": "33", "target": "53", "source_name": "circuit complexity", "target_name": "approximation algorithm", "weight": 1.0, "year": 2018}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2018}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 2.0, "year": 2018}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2018}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2018}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2018}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2018}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 6.0, "year": 2018}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2018}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2018}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2018}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 28.0, "year": 2018}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 6.0, "year": 2018}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2018}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2018}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2018}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 13.0, "year": 2018}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 3.0, "year": 2018}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 16.0, "year": 2018}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 5.0, "year": 2018}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2018}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2018}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 33.0, "year": 2018}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 1.0, "year": 2018}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 8.0, "year": 2018}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2018}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2018}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 2.0, "year": 2018}, {"source": "52", "target": "55", "source_name": "global optimization", "target_name": "graph isomorphism", "weight": 2.0, "year": 2018}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 24.0, "year": 2018}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2018}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2018}]}, {"2019": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2019}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2019}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2019}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2019}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2019}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 2.0, "year": 2019}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 10.0, "year": 2019}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2019}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2019}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2019}, {"source": "2", "target": "5", "source_name": "computational complexity", "target_name": "bin packing", "weight": 1.0, "year": 2019}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 10.0, "year": 2019}, {"source": "2", "target": "12", "source_name": "computational complexity", "target_name": "local search", "weight": 1.0, "year": 2019}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2019}, {"source": "2", "target": "15", "source_name": "computational complexity", "target_name": "planar graph", "weight": 2.0, "year": 2019}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 7.0, "year": 2019}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 4.0, "year": 2019}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2019}, {"source": "2", "target": "23", "source_name": "computational complexity", "target_name": "truth table", "weight": 1.0, "year": 2019}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 3.0, "year": 2019}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 2.0, "year": 2019}, {"source": "2", "target": "28", "source_name": "computational complexity", "target_name": "travelling salesman problem", "weight": 3.0, "year": 2019}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2019}, {"source": "2", "target": "33", "source_name": "computational complexity", "target_name": "circuit complexity", "weight": 1.0, "year": 2019}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2019}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 2.0, "year": 2019}, {"source": "2", "target": "43", "source_name": "computational complexity", "target_name": "shortest path", "weight": 2.0, "year": 2019}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 2.0, "year": 2019}, {"source": "2", "target": "52", "source_name": "computational complexity", "target_name": "global optimization", "weight": 1.0, "year": 2019}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 20.0, "year": 2019}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 3.0, "year": 2019}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2019}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2019}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2019}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2019}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2019}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2019}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2019}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2019}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2019}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2019}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2019}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2019}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 14.0, "year": 2019}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 2.0, "year": 2019}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 6.0, "year": 2019}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 2.0, "year": 2019}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 25.0, "year": 2019}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2019}, {"source": "6", "target": "15", "source_name": "hamiltonian cycle", "target_name": "planar graph", "weight": 1.0, "year": 2019}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2019}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2019}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 2.0, "year": 2019}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2019}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2019}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2019}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2019}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2019}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2019}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 10.0, "year": 2019}, {"source": "8", "target": "10", "source_name": "complexity theory", "target_name": "longest common subsequence", "weight": 1.0, "year": 2019}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2019}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2019}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2019}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2019}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 6.0, "year": 2019}, {"source": "8", "target": "55", "source_name": "complexity theory", "target_name": "graph isomorphism", "weight": 3.0, "year": 2019}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2019}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 4.0, "year": 2019}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 1.0, "year": 2019}, {"source": "10", "target": "33", "source_name": "longest common subsequence", "target_name": "circuit complexity", "weight": 1.0, "year": 2019}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 5.0, "year": 2019}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2019}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 3.0, "year": 2019}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2019}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 5.0, "year": 2019}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2019}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2019}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2019}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2019}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2019}, {"source": "12", "target": "34", "source_name": "local search", "target_name": "ant colony", "weight": 1.0, "year": 2019}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2019}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2019}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2019}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 15.0, "year": 2019}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 2.0, "year": 2019}, {"source": "13", "target": "29", "source_name": "vehicle routing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2019}, {"source": "13", "target": "38", "source_name": "vehicle routing", "target_name": "vertex cover", "weight": 1.0, "year": 2019}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 5.0, "year": 2019}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2019}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 3.0, "year": 2019}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 15.0, "year": 2019}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 3.0, "year": 2019}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2019}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2019}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2019}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 7.0, "year": 2019}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2019}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2019}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2019}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2019}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 4.0, "year": 2019}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2019}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 20.0, "year": 2019}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2019}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2019}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2019}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2019}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 6.0, "year": 2019}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2019}, {"source": "18", "target": "28", "source_name": "approximation ratio", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2019}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 11.0, "year": 2019}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2019}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2019}, {"source": "18", "target": "32", "source_name": "approximation ratio", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2019}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2019}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 10.0, "year": 2019}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2019}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 2.0, "year": 2019}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 2.0, "year": 2019}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2019}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 6.0, "year": 2019}, {"source": "18", "target": "49", "source_name": "approximation ratio", "target_name": "ad hoc", "weight": 1.0, "year": 2019}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2019}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 184.0, "year": 2019}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 6.0, "year": 2019}, {"source": "19", "target": "23", "source_name": "turing machine", "target_name": "truth table", "weight": 1.0, "year": 2019}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2019}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2019}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2019}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2019}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "20", "target": "24", "source_name": "triangle inequality", "target_name": "linear programming", "weight": 1.0, "year": 2019}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2019}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2019}, {"source": "20", "target": "36", "source_name": "triangle inequality", "target_name": "wiley periodicals", "weight": 1.0, "year": 2019}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 4.0, "year": 2019}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 23.0, "year": 2019}, {"source": "20", "target": "54", "source_name": "triangle inequality", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2019}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2019}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2019}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2019}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2019}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2019}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2019}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2019}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2019}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2019}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2019}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 5.0, "year": 2019}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2019}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2019}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2019}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2019}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 19.0, "year": 2019}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 30.0, "year": 2019}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2019}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 10.0, "year": 2019}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2019}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2019}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2019}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2019}, {"source": "26", "target": "45", "source_name": "np complete", "target_name": "euclidean space", "weight": 1.0, "year": 2019}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2019}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2019}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2019}, {"source": "28", "target": "40", "source_name": "travelling salesman problem", "target_name": "neural networks", "weight": 1.0, "year": 2019}, {"source": "28", "target": "42", "source_name": "travelling salesman problem", "target_name": "metric space", "weight": 1.0, "year": 2019}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2019}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2019}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2019}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2019}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2019}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 3.0, "year": 2019}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2019}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 5.0, "year": 2019}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2019}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 7.0, "year": 2019}, {"source": "29", "target": "45", "source_name": "combinatorial optimization", "target_name": "euclidean space", "weight": 1.0, "year": 2019}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2019}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 7.0, "year": 2019}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 3.0, "year": 2019}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 43.0, "year": 2019}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 4.0, "year": 2019}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2019}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2019}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 1.0, "year": 2019}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 19.0, "year": 2019}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2019}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2019}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2019}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 14.0, "year": 2019}, {"source": "32", "target": "38", "source_name": "minimum spanning tree", "target_name": "vertex cover", "weight": 1.0, "year": 2019}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2019}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 10.0, "year": 2019}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 10.0, "year": 2019}, {"source": "33", "target": "53", "source_name": "circuit complexity", "target_name": "approximation algorithm", "weight": 1.0, "year": 2019}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2019}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 2.0, "year": 2019}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2019}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2019}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2019}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2019}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 6.0, "year": 2019}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2019}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2019}, {"source": "38", "target": "43", "source_name": "vertex cover", "target_name": "shortest path", "weight": 1.0, "year": 2019}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2019}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 33.0, "year": 2019}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 6.0, "year": 2019}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2019}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2019}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2019}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 13.0, "year": 2019}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 3.0, "year": 2019}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 20.0, "year": 2019}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 6.0, "year": 2019}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 9.0, "year": 2019}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2019}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 33.0, "year": 2019}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 2.0, "year": 2019}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 8.0, "year": 2019}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 1.0, "year": 2019}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2019}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 3.0, "year": 2019}, {"source": "52", "target": "55", "source_name": "global optimization", "target_name": "graph isomorphism", "weight": 2.0, "year": 2019}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 25.0, "year": 2019}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2019}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2019}]}, {"2020": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2020}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2020}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2020}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2020}, {"source": "0", "target": "24", "source_name": "integer programming", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2020}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 2.0, "year": 2020}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 12.0, "year": 2020}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2020}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2020}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2020}, {"source": "2", "target": "5", "source_name": "computational complexity", "target_name": "bin packing", "weight": 1.0, "year": 2020}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 11.0, "year": 2020}, {"source": "2", "target": "12", "source_name": "computational complexity", "target_name": "local search", "weight": 1.0, "year": 2020}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2020}, {"source": "2", "target": "15", "source_name": "computational complexity", "target_name": "planar graph", "weight": 2.0, "year": 2020}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 8.0, "year": 2020}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 4.0, "year": 2020}, {"source": "2", "target": "21", "source_name": "computational complexity", "target_name": "resource allocation", "weight": 1.0, "year": 2020}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2020}, {"source": "2", "target": "23", "source_name": "computational complexity", "target_name": "truth table", "weight": 1.0, "year": 2020}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 3.0, "year": 2020}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 2.0, "year": 2020}, {"source": "2", "target": "28", "source_name": "computational complexity", "target_name": "travelling salesman problem", "weight": 3.0, "year": 2020}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2020}, {"source": "2", "target": "33", "source_name": "computational complexity", "target_name": "circuit complexity", "weight": 1.0, "year": 2020}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2020}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 2.0, "year": 2020}, {"source": "2", "target": "43", "source_name": "computational complexity", "target_name": "shortest path", "weight": 2.0, "year": 2020}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 3.0, "year": 2020}, {"source": "2", "target": "52", "source_name": "computational complexity", "target_name": "global optimization", "weight": 1.0, "year": 2020}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 21.0, "year": 2020}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 3.0, "year": 2020}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2020}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2020}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 3.0, "year": 2020}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2020}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2020}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2020}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2020}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2020}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2020}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2020}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2020}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2020}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 15.0, "year": 2020}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 2.0, "year": 2020}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 6.0, "year": 2020}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 3.0, "year": 2020}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 27.0, "year": 2020}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2020}, {"source": "6", "target": "15", "source_name": "hamiltonian cycle", "target_name": "planar graph", "weight": 1.0, "year": 2020}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2020}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2020}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 2.0, "year": 2020}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2020}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2020}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2020}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2020}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2020}, {"source": "7", "target": "38", "source_name": "semidefinite programming", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 2.0, "year": 2020}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 11.0, "year": 2020}, {"source": "8", "target": "10", "source_name": "complexity theory", "target_name": "longest common subsequence", "weight": 1.0, "year": 2020}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2020}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2020}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2020}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2020}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 6.0, "year": 2020}, {"source": "8", "target": "55", "source_name": "complexity theory", "target_name": "graph isomorphism", "weight": 3.0, "year": 2020}, {"source": "9", "target": "15", "source_name": "feedback vertex set", "target_name": "planar graph", "weight": 2.0, "year": 2020}, {"source": "9", "target": "18", "source_name": "feedback vertex set", "target_name": "approximation ratio", "weight": 1.0, "year": 2020}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2020}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 5.0, "year": 2020}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 4.0, "year": 2020}, {"source": "10", "target": "33", "source_name": "longest common subsequence", "target_name": "circuit complexity", "weight": 1.0, "year": 2020}, {"source": "10", "target": "35", "source_name": "longest common subsequence", "target_name": "computational biology", "weight": 1.0, "year": 2020}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 5.0, "year": 2020}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2020}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 3.0, "year": 2020}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2020}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 5.0, "year": 2020}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2020}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2020}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2020}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2020}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2020}, {"source": "12", "target": "34", "source_name": "local search", "target_name": "ant colony", "weight": 1.0, "year": 2020}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2020}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2020}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 15.0, "year": 2020}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 4.0, "year": 2020}, {"source": "13", "target": "29", "source_name": "vehicle routing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2020}, {"source": "13", "target": "38", "source_name": "vehicle routing", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 5.0, "year": 2020}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2020}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 3.0, "year": 2020}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 17.0, "year": 2020}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 3.0, "year": 2020}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2020}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2020}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2020}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 7.0, "year": 2020}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2020}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2020}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2020}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2020}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 4.0, "year": 2020}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2020}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 22.0, "year": 2020}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2020}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2020}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2020}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2020}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 7.0, "year": 2020}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2020}, {"source": "18", "target": "28", "source_name": "approximation ratio", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2020}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 12.0, "year": 2020}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2020}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2020}, {"source": "18", "target": "32", "source_name": "approximation ratio", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2020}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2020}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 12.0, "year": 2020}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2020}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 2.0, "year": 2020}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 2.0, "year": 2020}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2020}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 6.0, "year": 2020}, {"source": "18", "target": "49", "source_name": "approximation ratio", "target_name": "ad hoc", "weight": 1.0, "year": 2020}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2020}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 195.0, "year": 2020}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 6.0, "year": 2020}, {"source": "19", "target": "23", "source_name": "turing machine", "target_name": "truth table", "weight": 1.0, "year": 2020}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2020}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2020}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2020}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "20", "target": "24", "source_name": "triangle inequality", "target_name": "linear programming", "weight": 1.0, "year": 2020}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2020}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2020}, {"source": "20", "target": "36", "source_name": "triangle inequality", "target_name": "wiley periodicals", "weight": 1.0, "year": 2020}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 4.0, "year": 2020}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 24.0, "year": 2020}, {"source": "20", "target": "54", "source_name": "triangle inequality", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2020}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2020}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2020}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2020}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2020}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2020}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2020}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2020}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2020}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 5.0, "year": 2020}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2020}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2020}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2020}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 20.0, "year": 2020}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 31.0, "year": 2020}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2020}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 11.0, "year": 2020}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2020}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2020}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2020}, {"source": "26", "target": "45", "source_name": "np complete", "target_name": "euclidean space", "weight": 1.0, "year": 2020}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2020}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2020}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2020}, {"source": "28", "target": "40", "source_name": "travelling salesman problem", "target_name": "neural networks", "weight": 1.0, "year": 2020}, {"source": "28", "target": "42", "source_name": "travelling salesman problem", "target_name": "metric space", "weight": 1.0, "year": 2020}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2020}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2020}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2020}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2020}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2020}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 3.0, "year": 2020}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2020}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 5.0, "year": 2020}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 2.0, "year": 2020}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 8.0, "year": 2020}, {"source": "29", "target": "45", "source_name": "combinatorial optimization", "target_name": "euclidean space", "weight": 1.0, "year": 2020}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2020}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 8.0, "year": 2020}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 3.0, "year": 2020}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 44.0, "year": 2020}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 4.0, "year": 2020}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2020}, {"source": "30", "target": "32", "source_name": "network design", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2020}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2020}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 3.0, "year": 2020}, {"source": "30", "target": "45", "source_name": "network design", "target_name": "euclidean space", "weight": 1.0, "year": 2020}, {"source": "30", "target": "48", "source_name": "network design", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 22.0, "year": 2020}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2020}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2020}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 14.0, "year": 2020}, {"source": "32", "target": "38", "source_name": "minimum spanning tree", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2020}, {"source": "32", "target": "43", "source_name": "minimum spanning tree", "target_name": "shortest path", "weight": 1.0, "year": 2020}, {"source": "32", "target": "45", "source_name": "minimum spanning tree", "target_name": "euclidean space", "weight": 1.0, "year": 2020}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 11.0, "year": 2020}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 11.0, "year": 2020}, {"source": "33", "target": "53", "source_name": "circuit complexity", "target_name": "approximation algorithm", "weight": 1.0, "year": 2020}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2020}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 2.0, "year": 2020}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2020}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2020}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2020}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2020}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 6.0, "year": 2020}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2020}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2020}, {"source": "38", "target": "43", "source_name": "vertex cover", "target_name": "shortest path", "weight": 1.0, "year": 2020}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 37.0, "year": 2020}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 6.0, "year": 2020}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2020}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2020}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2020}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 13.0, "year": 2020}, {"source": "43", "target": "48", "source_name": "shortest path", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 3.0, "year": 2020}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 23.0, "year": 2020}, {"source": "45", "target": "48", "source_name": "euclidean space", "target_name": "spanning tree", "weight": 1.0, "year": 2020}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 7.0, "year": 2020}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 10.0, "year": 2020}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2020}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 35.0, "year": 2020}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 2.0, "year": 2020}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 8.0, "year": 2020}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 2.0, "year": 2020}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2020}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 3.0, "year": 2020}, {"source": "52", "target": "55", "source_name": "global optimization", "target_name": "graph isomorphism", "weight": 2.0, "year": 2020}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 25.0, "year": 2020}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2020}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2020}]}, {"2021": [{"source": "0", "target": "1", "source_name": "integer programming", "target_name": "hamming distance", "weight": 2.0, "year": 2021}, {"source": "0", "target": "2", "source_name": "integer programming", "target_name": "computational complexity", "weight": 1.0, "year": 2021}, {"source": "0", "target": "7", "source_name": "integer programming", "target_name": "semidefinite programming", "weight": 1.0, "year": 2021}, {"source": "0", "target": "13", "source_name": "integer programming", "target_name": "vehicle routing", "weight": 1.0, "year": 2021}, {"source": "0", "target": "24", "source_name": "integer programming", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "0", "target": "30", "source_name": "integer programming", "target_name": "network design", "weight": 2.0, "year": 2021}, {"source": "0", "target": "43", "source_name": "integer programming", "target_name": "shortest path", "weight": 2.0, "year": 2021}, {"source": "0", "target": "53", "source_name": "integer programming", "target_name": "approximation algorithm", "weight": 12.0, "year": 2021}, {"source": "1", "target": "6", "source_name": "hamming distance", "target_name": "hamiltonian cycle", "weight": 2.0, "year": 2021}, {"source": "1", "target": "29", "source_name": "hamming distance", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "1", "target": "53", "source_name": "hamming distance", "target_name": "approximation algorithm", "weight": 8.0, "year": 2021}, {"source": "2", "target": "5", "source_name": "computational complexity", "target_name": "bin packing", "weight": 1.0, "year": 2021}, {"source": "2", "target": "8", "source_name": "computational complexity", "target_name": "complexity theory", "weight": 11.0, "year": 2021}, {"source": "2", "target": "12", "source_name": "computational complexity", "target_name": "local search", "weight": 1.0, "year": 2021}, {"source": "2", "target": "14", "source_name": "computational complexity", "target_name": "hamiltonian path", "weight": 2.0, "year": 2021}, {"source": "2", "target": "15", "source_name": "computational complexity", "target_name": "planar graph", "weight": 2.0, "year": 2021}, {"source": "2", "target": "18", "source_name": "computational complexity", "target_name": "approximation ratio", "weight": 8.0, "year": 2021}, {"source": "2", "target": "19", "source_name": "computational complexity", "target_name": "turing machine", "weight": 4.0, "year": 2021}, {"source": "2", "target": "21", "source_name": "computational complexity", "target_name": "resource allocation", "weight": 1.0, "year": 2021}, {"source": "2", "target": "22", "source_name": "computational complexity", "target_name": "strongly connected", "weight": 1.0, "year": 2021}, {"source": "2", "target": "23", "source_name": "computational complexity", "target_name": "truth table", "weight": 1.0, "year": 2021}, {"source": "2", "target": "24", "source_name": "computational complexity", "target_name": "linear programming", "weight": 3.0, "year": 2021}, {"source": "2", "target": "26", "source_name": "computational complexity", "target_name": "np complete", "weight": 2.0, "year": 2021}, {"source": "2", "target": "28", "source_name": "computational complexity", "target_name": "travelling salesman problem", "weight": 3.0, "year": 2021}, {"source": "2", "target": "29", "source_name": "computational complexity", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "2", "target": "30", "source_name": "computational complexity", "target_name": "network design", "weight": 1.0, "year": 2021}, {"source": "2", "target": "33", "source_name": "computational complexity", "target_name": "circuit complexity", "weight": 1.0, "year": 2021}, {"source": "2", "target": "38", "source_name": "computational complexity", "target_name": "vertex cover", "weight": 2.0, "year": 2021}, {"source": "2", "target": "40", "source_name": "computational complexity", "target_name": "neural networks", "weight": 2.0, "year": 2021}, {"source": "2", "target": "43", "source_name": "computational complexity", "target_name": "shortest path", "weight": 2.0, "year": 2021}, {"source": "2", "target": "48", "source_name": "computational complexity", "target_name": "spanning tree", "weight": 3.0, "year": 2021}, {"source": "2", "target": "52", "source_name": "computational complexity", "target_name": "global optimization", "weight": 1.0, "year": 2021}, {"source": "2", "target": "53", "source_name": "computational complexity", "target_name": "approximation algorithm", "weight": 22.0, "year": 2021}, {"source": "2", "target": "54", "source_name": "computational complexity", "target_name": "linear program", "weight": 3.0, "year": 2021}, {"source": "3", "target": "18", "source_name": "unsplittable flow", "target_name": "approximation ratio", "weight": 4.0, "year": 2021}, {"source": "3", "target": "21", "source_name": "unsplittable flow", "target_name": "resource allocation", "weight": 3.0, "year": 2021}, {"source": "3", "target": "24", "source_name": "unsplittable flow", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "3", "target": "29", "source_name": "unsplittable flow", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "3", "target": "30", "source_name": "unsplittable flow", "target_name": "network design", "weight": 4.0, "year": 2021}, {"source": "3", "target": "36", "source_name": "unsplittable flow", "target_name": "wiley periodicals", "weight": 1.0, "year": 2021}, {"source": "3", "target": "43", "source_name": "unsplittable flow", "target_name": "shortest path", "weight": 1.0, "year": 2021}, {"source": "3", "target": "53", "source_name": "unsplittable flow", "target_name": "approximation algorithm", "weight": 14.0, "year": 2021}, {"source": "3", "target": "54", "source_name": "unsplittable flow", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "4", "target": "18", "source_name": "weighted completion", "target_name": "approximation ratio", "weight": 1.0, "year": 2021}, {"source": "4", "target": "24", "source_name": "weighted completion", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "4", "target": "29", "source_name": "weighted completion", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "4", "target": "50", "source_name": "weighted completion", "target_name": "open shop", "weight": 1.0, "year": 2021}, {"source": "4", "target": "53", "source_name": "weighted completion", "target_name": "approximation algorithm", "weight": 5.0, "year": 2021}, {"source": "5", "target": "9", "source_name": "bin packing", "target_name": "feedback vertex set", "weight": 2.0, "year": 2021}, {"source": "5", "target": "11", "source_name": "bin packing", "target_name": "probability distribution", "weight": 1.0, "year": 2021}, {"source": "5", "target": "15", "source_name": "bin packing", "target_name": "planar graph", "weight": 2.0, "year": 2021}, {"source": "5", "target": "18", "source_name": "bin packing", "target_name": "approximation ratio", "weight": 15.0, "year": 2021}, {"source": "5", "target": "24", "source_name": "bin packing", "target_name": "linear programming", "weight": 2.0, "year": 2021}, {"source": "5", "target": "25", "source_name": "bin packing", "target_name": "strip packing", "weight": 6.0, "year": 2021}, {"source": "5", "target": "29", "source_name": "bin packing", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "5", "target": "38", "source_name": "bin packing", "target_name": "vertex cover", "weight": 3.0, "year": 2021}, {"source": "5", "target": "53", "source_name": "bin packing", "target_name": "approximation algorithm", "weight": 27.0, "year": 2021}, {"source": "5", "target": "54", "source_name": "bin packing", "target_name": "linear program", "weight": 2.0, "year": 2021}, {"source": "6", "target": "15", "source_name": "hamiltonian cycle", "target_name": "planar graph", "weight": 1.0, "year": 2021}, {"source": "6", "target": "20", "source_name": "hamiltonian cycle", "target_name": "triangle inequality", "weight": 1.0, "year": 2021}, {"source": "6", "target": "24", "source_name": "hamiltonian cycle", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "6", "target": "29", "source_name": "hamiltonian cycle", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "6", "target": "53", "source_name": "hamiltonian cycle", "target_name": "approximation algorithm", "weight": 2.0, "year": 2021}, {"source": "6", "target": "54", "source_name": "hamiltonian cycle", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "7", "target": "12", "source_name": "semidefinite programming", "target_name": "local search", "weight": 1.0, "year": 2021}, {"source": "7", "target": "18", "source_name": "semidefinite programming", "target_name": "approximation ratio", "weight": 2.0, "year": 2021}, {"source": "7", "target": "29", "source_name": "semidefinite programming", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "7", "target": "30", "source_name": "semidefinite programming", "target_name": "network design", "weight": 1.0, "year": 2021}, {"source": "7", "target": "36", "source_name": "semidefinite programming", "target_name": "wiley periodicals", "weight": 1.0, "year": 2021}, {"source": "7", "target": "38", "source_name": "semidefinite programming", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "7", "target": "47", "source_name": "semidefinite programming", "target_name": "constraint satisfaction problem", "weight": 2.0, "year": 2021}, {"source": "7", "target": "53", "source_name": "semidefinite programming", "target_name": "approximation algorithm", "weight": 11.0, "year": 2021}, {"source": "8", "target": "10", "source_name": "complexity theory", "target_name": "longest common subsequence", "weight": 1.0, "year": 2021}, {"source": "8", "target": "15", "source_name": "complexity theory", "target_name": "planar graph", "weight": 1.0, "year": 2021}, {"source": "8", "target": "19", "source_name": "complexity theory", "target_name": "turing machine", "weight": 3.0, "year": 2021}, {"source": "8", "target": "26", "source_name": "complexity theory", "target_name": "np complete", "weight": 1.0, "year": 2021}, {"source": "8", "target": "29", "source_name": "complexity theory", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "8", "target": "47", "source_name": "complexity theory", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2021}, {"source": "8", "target": "53", "source_name": "complexity theory", "target_name": "approximation algorithm", "weight": 6.0, "year": 2021}, {"source": "8", "target": "55", "source_name": "complexity theory", "target_name": "graph isomorphism", "weight": 3.0, "year": 2021}, {"source": "9", "target": "15", "source_name": "feedback vertex set", "target_name": "planar graph", "weight": 2.0, "year": 2021}, {"source": "9", "target": "18", "source_name": "feedback vertex set", "target_name": "approximation ratio", "weight": 1.0, "year": 2021}, {"source": "9", "target": "29", "source_name": "feedback vertex set", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "9", "target": "30", "source_name": "feedback vertex set", "target_name": "network design", "weight": 1.0, "year": 2021}, {"source": "9", "target": "38", "source_name": "feedback vertex set", "target_name": "vertex cover", "weight": 5.0, "year": 2021}, {"source": "9", "target": "53", "source_name": "feedback vertex set", "target_name": "approximation algorithm", "weight": 4.0, "year": 2021}, {"source": "10", "target": "33", "source_name": "longest common subsequence", "target_name": "circuit complexity", "weight": 1.0, "year": 2021}, {"source": "10", "target": "35", "source_name": "longest common subsequence", "target_name": "computational biology", "weight": 1.0, "year": 2021}, {"source": "10", "target": "53", "source_name": "longest common subsequence", "target_name": "approximation algorithm", "weight": 5.0, "year": 2021}, {"source": "11", "target": "12", "source_name": "probability distribution", "target_name": "local search", "weight": 1.0, "year": 2021}, {"source": "11", "target": "53", "source_name": "probability distribution", "target_name": "approximation algorithm", "weight": 3.0, "year": 2021}, {"source": "12", "target": "14", "source_name": "local search", "target_name": "hamiltonian path", "weight": 1.0, "year": 2021}, {"source": "12", "target": "18", "source_name": "local search", "target_name": "approximation ratio", "weight": 5.0, "year": 2021}, {"source": "12", "target": "20", "source_name": "local search", "target_name": "triangle inequality", "weight": 1.0, "year": 2021}, {"source": "12", "target": "29", "source_name": "local search", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2021}, {"source": "12", "target": "30", "source_name": "local search", "target_name": "network design", "weight": 1.0, "year": 2021}, {"source": "12", "target": "31", "source_name": "local search", "target_name": "unit disk", "weight": 1.0, "year": 2021}, {"source": "12", "target": "32", "source_name": "local search", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2021}, {"source": "12", "target": "34", "source_name": "local search", "target_name": "ant colony", "weight": 1.0, "year": 2021}, {"source": "12", "target": "41", "source_name": "local search", "target_name": "maximal matching", "weight": 2.0, "year": 2021}, {"source": "12", "target": "44", "source_name": "local search", "target_name": "genetic algorithm", "weight": 1.0, "year": 2021}, {"source": "12", "target": "48", "source_name": "local search", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "12", "target": "53", "source_name": "local search", "target_name": "approximation algorithm", "weight": 15.0, "year": 2021}, {"source": "13", "target": "18", "source_name": "vehicle routing", "target_name": "approximation ratio", "weight": 4.0, "year": 2021}, {"source": "13", "target": "29", "source_name": "vehicle routing", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "13", "target": "36", "source_name": "vehicle routing", "target_name": "wiley periodicals", "weight": 2.0, "year": 2021}, {"source": "13", "target": "38", "source_name": "vehicle routing", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "13", "target": "42", "source_name": "vehicle routing", "target_name": "metric space", "weight": 6.0, "year": 2021}, {"source": "13", "target": "43", "source_name": "vehicle routing", "target_name": "shortest path", "weight": 1.0, "year": 2021}, {"source": "13", "target": "45", "source_name": "vehicle routing", "target_name": "euclidean space", "weight": 3.0, "year": 2021}, {"source": "13", "target": "53", "source_name": "vehicle routing", "target_name": "approximation algorithm", "weight": 17.0, "year": 2021}, {"source": "14", "target": "18", "source_name": "hamiltonian path", "target_name": "approximation ratio", "weight": 3.0, "year": 2021}, {"source": "14", "target": "24", "source_name": "hamiltonian path", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "14", "target": "26", "source_name": "hamiltonian path", "target_name": "np complete", "weight": 1.0, "year": 2021}, {"source": "14", "target": "32", "source_name": "hamiltonian path", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2021}, {"source": "14", "target": "48", "source_name": "hamiltonian path", "target_name": "spanning tree", "weight": 3.0, "year": 2021}, {"source": "14", "target": "53", "source_name": "hamiltonian path", "target_name": "approximation algorithm", "weight": 7.0, "year": 2021}, {"source": "14", "target": "54", "source_name": "hamiltonian path", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "15", "target": "18", "source_name": "planar graph", "target_name": "approximation ratio", "weight": 4.0, "year": 2021}, {"source": "15", "target": "19", "source_name": "planar graph", "target_name": "turing machine", "weight": 1.0, "year": 2021}, {"source": "15", "target": "24", "source_name": "planar graph", "target_name": "linear programming", "weight": 2.0, "year": 2021}, {"source": "15", "target": "29", "source_name": "planar graph", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "15", "target": "30", "source_name": "planar graph", "target_name": "network design", "weight": 1.0, "year": 2021}, {"source": "15", "target": "43", "source_name": "planar graph", "target_name": "shortest path", "weight": 4.0, "year": 2021}, {"source": "15", "target": "51", "source_name": "planar graph", "target_name": "graph coloring", "weight": 2.0, "year": 2021}, {"source": "15", "target": "53", "source_name": "planar graph", "target_name": "approximation algorithm", "weight": 23.0, "year": 2021}, {"source": "15", "target": "54", "source_name": "planar graph", "target_name": "linear program", "weight": 2.0, "year": 2021}, {"source": "18", "target": "20", "source_name": "approximation ratio", "target_name": "triangle inequality", "weight": 8.0, "year": 2021}, {"source": "18", "target": "21", "source_name": "approximation ratio", "target_name": "resource allocation", "weight": 2.0, "year": 2021}, {"source": "18", "target": "22", "source_name": "approximation ratio", "target_name": "strongly connected", "weight": 1.0, "year": 2021}, {"source": "18", "target": "24", "source_name": "approximation ratio", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "18", "target": "25", "source_name": "approximation ratio", "target_name": "strip packing", "weight": 7.0, "year": 2021}, {"source": "18", "target": "26", "source_name": "approximation ratio", "target_name": "np complete", "weight": 1.0, "year": 2021}, {"source": "18", "target": "28", "source_name": "approximation ratio", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2021}, {"source": "18", "target": "29", "source_name": "approximation ratio", "target_name": "combinatorial optimization", "weight": 12.0, "year": 2021}, {"source": "18", "target": "30", "source_name": "approximation ratio", "target_name": "network design", "weight": 8.0, "year": 2021}, {"source": "18", "target": "31", "source_name": "approximation ratio", "target_name": "unit disk", "weight": 1.0, "year": 2021}, {"source": "18", "target": "32", "source_name": "approximation ratio", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2021}, {"source": "18", "target": "36", "source_name": "approximation ratio", "target_name": "wiley periodicals", "weight": 4.0, "year": 2021}, {"source": "18", "target": "38", "source_name": "approximation ratio", "target_name": "vertex cover", "weight": 12.0, "year": 2021}, {"source": "18", "target": "41", "source_name": "approximation ratio", "target_name": "maximal matching", "weight": 5.0, "year": 2021}, {"source": "18", "target": "42", "source_name": "approximation ratio", "target_name": "metric space", "weight": 2.0, "year": 2021}, {"source": "18", "target": "43", "source_name": "approximation ratio", "target_name": "shortest path", "weight": 2.0, "year": 2021}, {"source": "18", "target": "47", "source_name": "approximation ratio", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2021}, {"source": "18", "target": "48", "source_name": "approximation ratio", "target_name": "spanning tree", "weight": 6.0, "year": 2021}, {"source": "18", "target": "49", "source_name": "approximation ratio", "target_name": "ad hoc", "weight": 1.0, "year": 2021}, {"source": "18", "target": "51", "source_name": "approximation ratio", "target_name": "graph coloring", "weight": 1.0, "year": 2021}, {"source": "18", "target": "53", "source_name": "approximation ratio", "target_name": "approximation algorithm", "weight": 200.0, "year": 2021}, {"source": "18", "target": "54", "source_name": "approximation ratio", "target_name": "linear program", "weight": 6.0, "year": 2021}, {"source": "19", "target": "23", "source_name": "turing machine", "target_name": "truth table", "weight": 1.0, "year": 2021}, {"source": "19", "target": "24", "source_name": "turing machine", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "19", "target": "26", "source_name": "turing machine", "target_name": "np complete", "weight": 4.0, "year": 2021}, {"source": "19", "target": "38", "source_name": "turing machine", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "19", "target": "51", "source_name": "turing machine", "target_name": "graph coloring", "weight": 1.0, "year": 2021}, {"source": "19", "target": "53", "source_name": "turing machine", "target_name": "approximation algorithm", "weight": 1.0, "year": 2021}, {"source": "19", "target": "54", "source_name": "turing machine", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "20", "target": "24", "source_name": "triangle inequality", "target_name": "linear programming", "weight": 1.0, "year": 2021}, {"source": "20", "target": "28", "source_name": "triangle inequality", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2021}, {"source": "20", "target": "29", "source_name": "triangle inequality", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "20", "target": "32", "source_name": "triangle inequality", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2021}, {"source": "20", "target": "36", "source_name": "triangle inequality", "target_name": "wiley periodicals", "weight": 1.0, "year": 2021}, {"source": "20", "target": "48", "source_name": "triangle inequality", "target_name": "spanning tree", "weight": 4.0, "year": 2021}, {"source": "20", "target": "53", "source_name": "triangle inequality", "target_name": "approximation algorithm", "weight": 24.0, "year": 2021}, {"source": "20", "target": "54", "source_name": "triangle inequality", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "20", "target": "55", "source_name": "triangle inequality", "target_name": "graph isomorphism", "weight": 1.0, "year": 2021}, {"source": "21", "target": "29", "source_name": "resource allocation", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "21", "target": "53", "source_name": "resource allocation", "target_name": "approximation algorithm", "weight": 8.0, "year": 2021}, {"source": "22", "target": "29", "source_name": "strongly connected", "target_name": "combinatorial optimization", "weight": 1.0, "year": 2021}, {"source": "22", "target": "31", "source_name": "strongly connected", "target_name": "unit disk", "weight": 1.0, "year": 2021}, {"source": "22", "target": "38", "source_name": "strongly connected", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "22", "target": "48", "source_name": "strongly connected", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "22", "target": "53", "source_name": "strongly connected", "target_name": "approximation algorithm", "weight": 5.0, "year": 2021}, {"source": "23", "target": "33", "source_name": "truth table", "target_name": "circuit complexity", "weight": 1.0, "year": 2021}, {"source": "24", "target": "29", "source_name": "linear programming", "target_name": "combinatorial optimization", "weight": 4.0, "year": 2021}, {"source": "24", "target": "35", "source_name": "linear programming", "target_name": "computational biology", "weight": 1.0, "year": 2021}, {"source": "24", "target": "38", "source_name": "linear programming", "target_name": "vertex cover", "weight": 5.0, "year": 2021}, {"source": "24", "target": "47", "source_name": "linear programming", "target_name": "constraint satisfaction problem", "weight": 1.0, "year": 2021}, {"source": "24", "target": "48", "source_name": "linear programming", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "24", "target": "50", "source_name": "linear programming", "target_name": "open shop", "weight": 1.0, "year": 2021}, {"source": "24", "target": "51", "source_name": "linear programming", "target_name": "graph coloring", "weight": 1.0, "year": 2021}, {"source": "24", "target": "53", "source_name": "linear programming", "target_name": "approximation algorithm", "weight": 21.0, "year": 2021}, {"source": "24", "target": "54", "source_name": "linear programming", "target_name": "linear program", "weight": 32.0, "year": 2021}, {"source": "24", "target": "55", "source_name": "linear programming", "target_name": "graph isomorphism", "weight": 3.0, "year": 2021}, {"source": "25", "target": "53", "source_name": "strip packing", "target_name": "approximation algorithm", "weight": 11.0, "year": 2021}, {"source": "25", "target": "54", "source_name": "strip packing", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "26", "target": "28", "source_name": "np complete", "target_name": "travelling salesman problem", "weight": 1.0, "year": 2021}, {"source": "26", "target": "29", "source_name": "np complete", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "26", "target": "38", "source_name": "np complete", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "26", "target": "43", "source_name": "np complete", "target_name": "shortest path", "weight": 2.0, "year": 2021}, {"source": "26", "target": "45", "source_name": "np complete", "target_name": "euclidean space", "weight": 1.0, "year": 2021}, {"source": "26", "target": "48", "source_name": "np complete", "target_name": "spanning tree", "weight": 2.0, "year": 2021}, {"source": "26", "target": "53", "source_name": "np complete", "target_name": "approximation algorithm", "weight": 4.0, "year": 2021}, {"source": "28", "target": "29", "source_name": "travelling salesman problem", "target_name": "combinatorial optimization", "weight": 2.0, "year": 2021}, {"source": "28", "target": "40", "source_name": "travelling salesman problem", "target_name": "neural networks", "weight": 1.0, "year": 2021}, {"source": "28", "target": "42", "source_name": "travelling salesman problem", "target_name": "metric space", "weight": 1.0, "year": 2021}, {"source": "28", "target": "43", "source_name": "travelling salesman problem", "target_name": "shortest path", "weight": 1.0, "year": 2021}, {"source": "28", "target": "48", "source_name": "travelling salesman problem", "target_name": "spanning tree", "weight": 2.0, "year": 2021}, {"source": "28", "target": "53", "source_name": "travelling salesman problem", "target_name": "approximation algorithm", "weight": 3.0, "year": 2021}, {"source": "29", "target": "30", "source_name": "combinatorial optimization", "target_name": "network design", "weight": 2.0, "year": 2021}, {"source": "29", "target": "32", "source_name": "combinatorial optimization", "target_name": "minimum spanning tree", "weight": 2.0, "year": 2021}, {"source": "29", "target": "34", "source_name": "combinatorial optimization", "target_name": "ant colony", "weight": 3.0, "year": 2021}, {"source": "29", "target": "35", "source_name": "combinatorial optimization", "target_name": "computational biology", "weight": 2.0, "year": 2021}, {"source": "29", "target": "38", "source_name": "combinatorial optimization", "target_name": "vertex cover", "weight": 5.0, "year": 2021}, {"source": "29", "target": "42", "source_name": "combinatorial optimization", "target_name": "metric space", "weight": 3.0, "year": 2021}, {"source": "29", "target": "43", "source_name": "combinatorial optimization", "target_name": "shortest path", "weight": 8.0, "year": 2021}, {"source": "29", "target": "45", "source_name": "combinatorial optimization", "target_name": "euclidean space", "weight": 1.0, "year": 2021}, {"source": "29", "target": "47", "source_name": "combinatorial optimization", "target_name": "constraint satisfaction problem", "weight": 5.0, "year": 2021}, {"source": "29", "target": "48", "source_name": "combinatorial optimization", "target_name": "spanning tree", "weight": 8.0, "year": 2021}, {"source": "29", "target": "50", "source_name": "combinatorial optimization", "target_name": "open shop", "weight": 3.0, "year": 2021}, {"source": "29", "target": "53", "source_name": "combinatorial optimization", "target_name": "approximation algorithm", "weight": 44.0, "year": 2021}, {"source": "29", "target": "54", "source_name": "combinatorial optimization", "target_name": "linear program", "weight": 4.0, "year": 2021}, {"source": "30", "target": "31", "source_name": "network design", "target_name": "unit disk", "weight": 1.0, "year": 2021}, {"source": "30", "target": "32", "source_name": "network design", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2021}, {"source": "30", "target": "36", "source_name": "network design", "target_name": "wiley periodicals", "weight": 1.0, "year": 2021}, {"source": "30", "target": "43", "source_name": "network design", "target_name": "shortest path", "weight": 3.0, "year": 2021}, {"source": "30", "target": "45", "source_name": "network design", "target_name": "euclidean space", "weight": 1.0, "year": 2021}, {"source": "30", "target": "48", "source_name": "network design", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "30", "target": "53", "source_name": "network design", "target_name": "approximation algorithm", "weight": 22.0, "year": 2021}, {"source": "31", "target": "32", "source_name": "unit disk", "target_name": "minimum spanning tree", "weight": 1.0, "year": 2021}, {"source": "31", "target": "38", "source_name": "unit disk", "target_name": "vertex cover", "weight": 2.0, "year": 2021}, {"source": "31", "target": "48", "source_name": "unit disk", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "31", "target": "53", "source_name": "unit disk", "target_name": "approximation algorithm", "weight": 14.0, "year": 2021}, {"source": "32", "target": "38", "source_name": "minimum spanning tree", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "32", "target": "42", "source_name": "minimum spanning tree", "target_name": "metric space", "weight": 1.0, "year": 2021}, {"source": "32", "target": "43", "source_name": "minimum spanning tree", "target_name": "shortest path", "weight": 1.0, "year": 2021}, {"source": "32", "target": "45", "source_name": "minimum spanning tree", "target_name": "euclidean space", "weight": 1.0, "year": 2021}, {"source": "32", "target": "48", "source_name": "minimum spanning tree", "target_name": "spanning tree", "weight": 11.0, "year": 2021}, {"source": "32", "target": "53", "source_name": "minimum spanning tree", "target_name": "approximation algorithm", "weight": 11.0, "year": 2021}, {"source": "33", "target": "53", "source_name": "circuit complexity", "target_name": "approximation algorithm", "weight": 1.0, "year": 2021}, {"source": "34", "target": "51", "source_name": "ant colony", "target_name": "graph coloring", "weight": 1.0, "year": 2021}, {"source": "34", "target": "53", "source_name": "ant colony", "target_name": "approximation algorithm", "weight": 2.0, "year": 2021}, {"source": "35", "target": "38", "source_name": "computational biology", "target_name": "vertex cover", "weight": 1.0, "year": 2021}, {"source": "35", "target": "53", "source_name": "computational biology", "target_name": "approximation algorithm", "weight": 5.0, "year": 2021}, {"source": "35", "target": "54", "source_name": "computational biology", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "36", "target": "42", "source_name": "wiley periodicals", "target_name": "metric space", "weight": 1.0, "year": 2021}, {"source": "36", "target": "43", "source_name": "wiley periodicals", "target_name": "shortest path", "weight": 1.0, "year": 2021}, {"source": "36", "target": "53", "source_name": "wiley periodicals", "target_name": "approximation algorithm", "weight": 6.0, "year": 2021}, {"source": "37", "target": "53", "source_name": "black hole", "target_name": "approximation algorithm", "weight": 2.0, "year": 2021}, {"source": "38", "target": "41", "source_name": "vertex cover", "target_name": "maximal matching", "weight": 1.0, "year": 2021}, {"source": "38", "target": "43", "source_name": "vertex cover", "target_name": "shortest path", "weight": 1.0, "year": 2021}, {"source": "38", "target": "48", "source_name": "vertex cover", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "38", "target": "53", "source_name": "vertex cover", "target_name": "approximation algorithm", "weight": 37.0, "year": 2021}, {"source": "38", "target": "54", "source_name": "vertex cover", "target_name": "linear program", "weight": 6.0, "year": 2021}, {"source": "40", "target": "52", "source_name": "neural networks", "target_name": "global optimization", "weight": 2.0, "year": 2021}, {"source": "41", "target": "53", "source_name": "maximal matching", "target_name": "approximation algorithm", "weight": 3.0, "year": 2021}, {"source": "42", "target": "48", "source_name": "metric space", "target_name": "spanning tree", "weight": 4.0, "year": 2021}, {"source": "42", "target": "53", "source_name": "metric space", "target_name": "approximation algorithm", "weight": 14.0, "year": 2021}, {"source": "43", "target": "48", "source_name": "shortest path", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "43", "target": "50", "source_name": "shortest path", "target_name": "open shop", "weight": 3.0, "year": 2021}, {"source": "43", "target": "53", "source_name": "shortest path", "target_name": "approximation algorithm", "weight": 23.0, "year": 2021}, {"source": "45", "target": "48", "source_name": "euclidean space", "target_name": "spanning tree", "weight": 1.0, "year": 2021}, {"source": "45", "target": "53", "source_name": "euclidean space", "target_name": "approximation algorithm", "weight": 7.0, "year": 2021}, {"source": "47", "target": "53", "source_name": "constraint satisfaction problem", "target_name": "approximation algorithm", "weight": 10.0, "year": 2021}, {"source": "47", "target": "54", "source_name": "constraint satisfaction problem", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "47", "target": "55", "source_name": "constraint satisfaction problem", "target_name": "graph isomorphism", "weight": 1.0, "year": 2021}, {"source": "48", "target": "53", "source_name": "spanning tree", "target_name": "approximation algorithm", "weight": 35.0, "year": 2021}, {"source": "48", "target": "54", "source_name": "spanning tree", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "49", "target": "53", "source_name": "ad hoc", "target_name": "approximation algorithm", "weight": 2.0, "year": 2021}, {"source": "50", "target": "53", "source_name": "open shop", "target_name": "approximation algorithm", "weight": 8.0, "year": 2021}, {"source": "51", "target": "53", "source_name": "graph coloring", "target_name": "approximation algorithm", "weight": 2.0, "year": 2021}, {"source": "51", "target": "54", "source_name": "graph coloring", "target_name": "linear program", "weight": 1.0, "year": 2021}, {"source": "52", "target": "53", "source_name": "global optimization", "target_name": "approximation algorithm", "weight": 4.0, "year": 2021}, {"source": "52", "target": "55", "source_name": "global optimization", "target_name": "graph isomorphism", "weight": 2.0, "year": 2021}, {"source": "53", "target": "54", "source_name": "approximation algorithm", "target_name": "linear program", "weight": 25.0, "year": 2021}, {"source": "53", "target": "55", "source_name": "approximation algorithm", "target_name": "graph isomorphism", "weight": 3.0, "year": 2021}, {"source": "54", "target": "55", "source_name": "linear program", "target_name": "graph isomorphism", "weight": 3.0, "year": 2021}]}]}