4843 search results - page 222 / 969 » The Shortcut Problem - Complexity and Approximation |
128
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
144
click to vote
ISPEC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
127
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
111
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
126
click to vote
IPL
2006
15 years 3 months ago
2006
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...