1480 search results - page 25 / 296 » Distributed algorithms for weighted problems in sparse graph... |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
ICTAC
2005
Springer
14 years 1 months ago
2005
Springer
We present a new derivation of eļ¬cient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
OA
1989
13 years 11 months ago
1989
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
ALGORITHMICA
1998
13 years 7 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...