2957 search results - page 98 / 592 » The Complexity of Polynomial-Time Approximation |
132
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
103
click to vote
EURODAC
1994
IEEE
15 years 7 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
142
click to vote
ESA
2000
Springer
15 years 6 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
121
click to vote
IJCAI
2007
15 years 4 months ago
2007
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
142
click to vote
CATS
2006
15 years 4 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...