833 citations · 1.7k across the 18 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.OC2016
Output-sensitive Complexity of Multiobjective Combinatorial Optimization
Fritz Bökler, Matthias Ehrgott, Christopher Morris +1
We study output-sensitive algorithms and complexity for multiobjective combinatorial optimization problems. In this computational complexity framework, an algorithm for a general e…
cs.LG2016
Faster Kernels for Graphs with Continuous Attributes via Hashing
Christopher Morris, Nils M. Kriege, Kristian Kersting +1
While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortu…