Searching for authors named "Anastasios Sidiropoulos" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Circular Partitions with Applications to Visualization and
- …We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small aspect ratio, and satisfying specified volume constraints. We apply these partitions to obtain a natural extension of the…
- Add To MetaCart
-
Probabilistic embeddings of bounded genus graphs into planar graphs
- …Ì��ÓÒ×Ø�ÒØC�×�ÐÐ��Ø����×ØÓÖØ�ÓÒÓ�Ø���Ñ�����Ò � ÄÓÛ��×ØÓÖØ�ÓÒÔÖÓ����Ð�×Ø��Ñ�����Ò�×�Ò��Ð�Ö��Ù�Ò��Ð �ÓÖ�Ø�Ñ�ÔÖÓ�Ð�Ñ×ÓÚ�Ö���Ö���Ù�×ØÑ�ØÖ�×�ÒØÓ���×Ý� i�×ÒÓØ�Ö��Ø�ÖØ��Ò×ÓÑ�ÓÒ×Ø�ÒØCØ�Ñ� × �Ð�××��Ð�Ø�Ö�ÒØ��××�Ø�ÓÒ�ÓÖ��ÓÖÑ�Ð���Ò�Ø�ÓÒ�ÓÖ �Ò�ØÙÖ�Ð��Ò�Ö�Ð�Þ�Ø�ÓÒÓ�ÔÐ�Ò�Ö�ØÝ�Ò��Ó�Ø��Ò��Ù× �Ü�ÑÔÐ��ÔÐ�Ò�Ö�Ö�Ô���×�…
- Cited by 4 (1 self) – Add To MetaCart
-
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
- …Motivated by the problem of allocating optical bandwidth in tree--shaped WDM networks, we study the fractional path coloring problem in trees. We consider the class of locally-symmetric sets of paths on binary trees and prove that any such set of paths has a fractional coloring of cost at most 1…
- Cited by 1 (0 self) – Add To MetaCart
-
Approximation algorithms for embedding general metrics into trees
- ……
- Cited by 2 (0 self) – Add To MetaCart
-
Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces
- …Abstract We present several approximation algorithms for theproblem of embedding metric spaces into a line, and into the two-dimensional plane. Among other results, wegive an O(pn)-approximation algorithm for the prob-lem of finding a line embedding of a metric induced by a given unweighted graph, t…
- Cited by 13 (5 self) – Add To MetaCart
-
On the Geometry of Graphs with a Forbidden Minor
- …We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture to a pair of manifestly simpler conjectures. The GNRS conjecture characterizes all graphs that have an O(1)approximate mul…
- Add To MetaCart
-
On the complexity of processing massive, unordered, distributed data
- …The popular model for processing massive data sets is the streaming model in which the processor makes a pass over the input with polylog(n)-space. However, with current data sets, even making a single pass will take unreasonable amount of time, and in practice, the solution is to distribute the dat…
- Cited by 1 (1 self) – Add To MetaCart
-
Convergence and approximation in potential games
- …AMS subject classifications. 15A15 Abstract. We study the speed of convergence to approximately optimal states in two classes of potential games. We provide bounds in terms of the number of rounds, where a round consists of a sequence of movements, with each player appearing at least once in each ro…
- Cited by 10 (1 self) – Add To MetaCart
-
Ordinal embeddings of minimum relaxation: General properties, trees and ultrametrics
- …We introduce a new notion of embedding, called minimumrelaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedding, it is the relative order between pairs of distances, and not the distances themselves, that must be preserved as much…
- Cited by 6 (3 self) – Add To MetaCart
-
Approximation Algorithms for Low-Distortion Embeddings Into
- …We present several approximation algorithms for the problem of embedding metric spaces into a line, and into the two-dimensional plane. Among other results, we give an O( # n)-approximation algorithm for the problem of finding a line embedding of a metric induced by a given unweighted graph, that mi…
- Add To MetaCart
Showing 1 through 10.
