Sciweavers

1090 search results - page 114 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 9 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
ICALP
2010
Springer
14 years 1 months ago
Streaming Algorithms for Independent Sets
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
Bjarni V. Halldórsson, Magnús M. Hal...
DAGSTUHL
2007
13 years 10 months ago
Weighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
Bruno Simeone, Federica Ricca, Andrea Scozzari
FLAIRS
2003
13 years 10 months ago
Incremental Breakout Algorithm with Variable Ordering
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...
Carlos Eisenberg, Boi Faltings
MST
2002
169views more  MST 2002»
13 years 8 months ago
Bulk Synchronous Parallel Algorithms for the External Memory Model
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
Frank K. H. A. Dehne, Wolfgang Dittrich, David A. ...