8 citations · 36 across the 23 of their papers we have counts for
3 papers · 1 filter
Minimum Sum Vertex Cover via Minimum Vertex Cover
Ahmad Biniaz, Jean-Lou De Carufel, Anil Maheshwari +2
The Minimum Sum Vertex Cover (MSVC) problem asks for an ordering of the vertices of a graph that minimizes the sum, over all edges, of the time at which each edge is first covered.…
Towards a General Framework for Searching on a Line and Searching on Rays
Prosenjit Bose, Jean-Lou De Carufel
Consider the following classical search problem: given a target point , starting at the origin, find with minimum cost, where cost is defined as the distance travelle…
Revisiting the Problem of Searching on a Line
Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher
We revisit the problem of searching for a target at an unknown location on a line when given upper and lower bounds on the distance D that separates the initial position of the sea…