900 search results - page 13 / 180 » On Polynomial Time Computation over Unordered Structures |
152
click to vote
INFOCOM
2009
IEEE
16 years 16 days ago
2009
IEEE
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
164
click to vote
STACS
2009
Springer
16 years 20 days ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
169
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
189
click to vote
IJCAI
1993
15 years 7 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
167
click to vote
ADAEUROPE
2003
Springer
15 years 11 months ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...