Results 1 - 10
of
12
Graph Partitioning with Natural Cuts
- In IPDPS. IEEE Computer Society
, 2011
"... Abstract. We present a novel approach to graph partitioning based on the notion of natural cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves ..."
Abstract
-
Cited by 23 (9 self)
- Add to MetaCart
(Show Context)
Abstract. We present a novel approach to graph partitioning based on the notion of natural cuts. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general structure. The second phase uses a combination of greedy and local search heuristics to assemble the final partition. The algorithm performs especially well on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries). In a few minutes, it obtains excellent partitions for continental-sized networks. 1
Hierarchical Hub Labelings for Shortest Paths
- PROCEEDINGS OF THE 20TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA’12), VOLUME 7501 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2012
"... We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling ap-proach practical for a wider class of graphs. We also find smaller labels for road networks, impro ..."
Abstract
-
Cited by 22 (12 self)
- Add to MetaCart
(Show Context)
We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling ap-proach practical for a wider class of graphs. We also find smaller labels for road networks, improving the query speed.
Fast Detour Computation for Ride Sharing
, 2009
"... Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So finding a connection between big cities is quite easy. These places are on a list of designated origin and destination poin ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
Today’s ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So finding a connection between big cities is quite easy. These places are on a list of designated origin and destination points. But when you want to go from a small town to another small town, even when they are next to a freeway, you run into problems. You can’t find offers that would or could pass by the town easily with little or no detour. We solve this interesting problem by presenting a fast algorithm that computes the offers with the smallest detours w.r.t. a request. Our experiments show that the problem is efficiently solvable in times suitable for a web service implementation. For realistic database size we achieve look-up times of about 5ms and a matching rate of 90 % instead of just 70 % for the simple matching algorithms used today. 1
Recent advances in graph partitioning
, 2013
"... We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions. ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
(Show Context)
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions.
Efficient route compression for hybrid route planning
- In MedAlg
, 2012
"... Abstract. We describe an algorithmic framework for lossless compres-sion of route descriptions. This is useful for hybrid route planning where routes are computed by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. We describe an algorithmic framework for lossless compres-sion of route descriptions. This is useful for hybrid route planning where routes are computed by a server and then transmitted to a client device in a car using some mobile radio communication where bandwidth may be low. Compressed routes are represented by only a few via nodes which are the connection points when the route is decomposed into unique op-timal segments. To reconstruct the route efficiently a client device needs basic but fast route planning capability. Contraction hierarchies make this approach fast enough for practice: Compressing takes only a few milliseconds. And previous experiments suggest that a client can decom-press each route segment virtually instantaneously. So, as the segments can be decompressed successively while driving, it is not likely that the driver experiences any delay except for the time needed by the mobile communication. 1
Robust Mobile Route Planning with Limited Connectivity
, 2012
"... We study the problem of route planning on mobile devices. There are two current approaches to this problem. One option is to have all the routing data on the device, which can then compute routes by itself. This makes it hard to incorporate traffic updates, leading to suboptimal routes. An alternati ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
We study the problem of route planning on mobile devices. There are two current approaches to this problem. One option is to have all the routing data on the device, which can then compute routes by itself. This makes it hard to incorporate traffic updates, leading to suboptimal routes. An alternative approach outsources the route computation to a server, which then sends only the route to the device. The downside is that a user is lost when deviating from the proposed route in an area with limited connectivity. In this work, we present an approach that combines the best of both worlds. The server performs the route computation but, instead of sending only the route to the user, it sends a corridor that is robust against deviations. We define these corridors properly and show that their size can be theoretically bounded in road networks. We evaluate their quality experimentally in terms of size and robustness on a continental road network. Finally, we introduce several algorithms to compute corridors efficiently. Our experimental analysis shows that our corridors are small but very robust against deviations, and can be computed quickly on a standard server.
KaHIP v0.6 -- Karlsruhe High Quality Partitioning -- user guide
"... This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the cu ..."
Abstract
- Add to MetaCart
This paper severs as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions pro-
KaMIS v1.0 -- Karlsruhe Maximum Independent Sets: User Guide
"... This paper serves as a user guide to the framework KaMIS (Karlsruhe Maximum Independent Sets). The framwork computes high quality independent sets in huge sparse graphs. We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats u ..."
Abstract
- Add to MetaCart
This paper serves as a user guide to the framework KaMIS (Karlsruhe Maximum Independent Sets). The framwork computes high quality independent sets in huge sparse graphs. We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used.
KaHIP v0.73 -- Karlsruhe High Quality Partitioning -- User Guide
"... This paper serves as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the cu ..."
Abstract
- Add to MetaCart
This paper serves as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions pro-
KaHIP v0.71 -- Karlsruhe High Quality Partitioning -- User Guide
"... This paper serves as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the cu ..."
Abstract
- Add to MetaCart
This paper serves as a user guide to the graph partitioning framework KaHIP (Karlsruhe High Quality Partitioning). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used. Moreover, we provide a short description of the current library functions pro-