4903 search results - page 28 / 981 » The Set Covering Machine |
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Presentation
A nice presentation by Daniel Cremers at the European Conference on Computer Vision (ECCV) 2006, covering a wide range of computer vision applications that the level set methods ca...
WECWIS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we present a novel approach and a system for automated selection of building blocks, by exploiting business processes semantics. The selection process is based on a ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...
WG
2007
Springer
14 years 1 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...