Sciweavers

75 search results - page 10 / 15
» Triangle Fixing Algorithms for the Metric Nearness Problem
Sort
View
JACM
2006
134views more  JACM 2006»
13 years 8 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 9 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
FOCS
2004
IEEE
14 years 9 days ago
Triangulation and Embedding Using Small Sets of Beacons
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler
GD
2000
Springer
14 years 6 days ago
Labeling Points with Rectangles of Various Shapes
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
Shin-Ichi Nakano, Takao Nishizeki, Takeshi Tokuyam...
CGF
2008
127views more  CGF 2008»
13 years 8 months ago
Fitting Sharp Features with Loop Subdivision Surfaces
Various methods have been proposed for fitting subdivision surfaces to different forms of shape data (e.g., dense meshes or point clouds), but none of these methods effectively de...
Ruotian Ling, Wenping Wang, Dong-Ming Yan