Sciweavers

1977 search results - page 278 / 396
» The satisfactory partition problem
Sort
View
147
Voted
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 4 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
137
Voted
IPCO
1992
112views Optimization» more  IPCO 1992»
15 years 4 months ago
The Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
Monique Laurent, Svatopluk Poljak
GD
2008
Springer
15 years 4 months ago
Graph Simultaneous Embedding Tool, GraphSET
Abstract. Problems in simultaneous graph drawing involve the layout of several graphs on a shared vertex set. This paper describes a Graph Simultaneous Embedding Tool, GraphSET, de...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
OSN
2008
83views more  OSN 2008»
15 years 3 months ago
Path selection in user-controlled circuit-switched optical networks
User-controlled circuit-switched optical networks are gaining popularity in an effort to fulfill the insatiable data transport needs of the online community. In this paper we cons...
Wojciech M. Golab, Raouf Boutaba
JMMA
2002
90views more  JMMA 2002»
15 years 3 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...