Sciweavers

6740 search results - page 309 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ATMOS
2010
308views Optimization» more  ATMOS 2010»
15 years 3 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
WG
2010
Springer
15 years 2 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter
147
Voted
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 10 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
ICRA
2002
IEEE
98views Robotics» more  ICRA 2002»
15 years 9 months ago
Sensor-Based Exploration for Convex Bodies: A New Roadmap for a Convex-Shaped Robot
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...
Ji Yeong Lee, Howie Choset
CGF
2010
112views more  CGF 2010»
15 years 4 months ago
Winding Roads: Routing edges into bundles
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
A. Lambert, Romain Bourqui, David Auber