6740 search results - page 448 / 1348 » An s -Hamiltonian Line Graph Problem |
203
click to vote
COCOON
2003
Springer
16 years 1 days ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
194
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
174
click to vote
ALGOSENSORS
2009
Springer
16 years 1 months ago
2009
Springer
We study scenarios where mobile hubs are charged with building a communication bridge between two given points s and t. We introduce a new bi-criteria optimization problem where th...
177
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper proposes a new way to achieve robotic tasks by visual servoing. Instead of using geometric features (points, straight lines, pose, homography, etc.) as it is usually...
187
click to vote
CP
2005
Springer
16 years 10 days ago
2005
Springer
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT p...