We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
This paper proposes an embedded rate scalable wavelet-based image coding algorithm. We introduce a simple and efficient approach for coding the positions and the signs of the wave...
The three-dimensional (3-D) SPIHT coder is a scalable or embedded coder that has proved its efficiency and its real-time capability in compression of video. A forward-error-correc...
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...