5889 search results - page 302 / 1178 » Graph Layout Problems |
154
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
222
click to vote
COMPGEOM
2006
ACM
16 years 20 days ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
175
click to vote
COR
2008
15 years 6 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
189
click to vote
IPL
2010
15 years 4 months ago
2010
Polynomial algorithms are given for the following two problems:
191
click to vote
NETWORKS
2011
15 years 1 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...