3875 search results - page 154 / 775 » Approximation algorithms for the 0-extension problem |
113
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
142
click to vote
PAMI
2011
14 years 11 months ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
120
Voted
QEST
2006
IEEE
15 years 10 months ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...
133
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
155
click to vote
AAIM
2006
Springer
15 years 10 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...