Titlebook: Experimental Algorithms; 15th International S Andrew V. Goldberg,Alexander S. Kulikov Conference proceedings 2016 Springer International Pu

正论

Sparse Subgraphs for 2-Connectivity in Directed Graphs,ns the pairwise 2-vertex-connectivity of ., i.e., the 2-vertex-connected blocks of . (.). We provide linear-time approximation algorithms for this problem that achieve an approximation ratio of 6. Based on these algorithms, we show how to approximate, in linear time, within a factor of 6 the smalles

袋鼠

Creditee

巨大没有

Engineering Hybrid DenseZDDs,ntations, they still use large amount of memory to support dynamic operations such as taking union and intersection of set families. DenseZDDs and Hybrid DenseZDDs [Denzumi et al. 2014] have been proposed to compress the size of static and dynamic ZDDs, respectively. There exist however no implement

Debrief

Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances,imum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated in a greedy fashion to obtain a low cost tree spanning all terminals. The weakness of this approach is that obtained solutions are topologically related to mi

CLASP

Tractable Pathfinding for the Stochastic On-Time Arrival Problem,nown as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the .-based SOTA problem—which is of pseudo-polynomial-time complexity in the time budget of the journey—as a search heuristic for the optimal path. In part

LAVA

An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem,amination of a broad range of algorithmic techniques reveals that greedy algorithms offer particularly striking performance, delivering very good solutions at low computational cost. Interestingly, their relative ranking does not follow their worst case behavior. Johnson’s deterministic algorithm is

奇思怪想

inhumane

An Empirical Study of Online Packet Scheduling Algorithms,lease time ., with a non-negative weight . and an integer deadline .. At each time step, at most one packet is scheduled. The modified greedy (MG) algorithm is 1.618-competitive for the objective of maximizing the sum of weights of packets sent, assuming agreeable deadlines. We analyze the empirical

Mast-Cell

Andrew V. Goldberg,Alexander S. KulikovIncludes supplementary material: