6740 search results - page 230 / 1348 » An s -Hamiltonian Line Graph Problem |
117
Voted
EMMCVPR
2005
Springer
15 years 6 months ago
2005
Springer
This paper is devoted to piecewise-constant segmentation of images using a curve evolution approach in a variational formulation. The problem to be solved is also called the minima...
91
Voted
APVIS
2007
15 years 2 months ago
2007
We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site ...
ORL
2006
15 years 17 days ago
2006
This article introduces a proper redefinition of the concept of bottleneck Steiner distance for the Prize-Collecting Steiner Problem. This allows the application of reduction test...
111
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
95
Voted
NETWORKS
2008
15 years 18 days ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...