We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eule...
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Abstract. We propose a method for object category localization by partially matching edge contours to a single shape prototype of the category. Previous work in this area either re...
Hayko Riemenschneider, Michael Donoser, and Horst ...
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...