4843 search results - page 335 / 969 » The Shortcut Problem - Complexity and Approximation |
146
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
130
click to vote
NETWORKS
2007
15 years 3 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
107
click to vote
ECCV
1996
Springer
16 years 6 months ago
1996
Springer
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-redu...
167
click to vote
RTAS
2006
IEEE
15 years 10 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
128
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...