434 search results - page 62 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
123
Voted
EOR
2008
15 years 3 months ago
2008
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
136
Voted
STACS
2010
Springer
15 years 10 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
118
Voted
ICCAD
2004
IEEE
16 years 18 days ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
157
Voted
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
113
Voted
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...