5889 search results - page 915 / 1178 » Graph Layout Problems |
217
click to vote
SPAA
1999
ACM
15 years 11 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
196
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
188
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
189
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
161
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
This paper is focused on the Co-segmentation problem
[1] – where the objective is to segment a similar object from
a pair of images. The background in the two images may be
ar...