Journal of Experimental Algorithmics最新文献

Random projections for Linear Programming: an improved retrieval phase 线性规划的随机投影：一个改进的检索阶段

Journal of Experimental Algorithmics Pub Date : 2023-08-28 DOI: 10.1145/3617506

Leo Liberti, Benedetto Manca, Pierre-Louis Poirion

引用次数: 0

SAT-Boosted Tabu Search for Coloring Massive Graphs 大规模图着色的sat增强禁忌搜索

Journal of Experimental Algorithmics Pub Date : 2023-07-25 DOI: 10.1145/3603112

André Schidler, Stefan Szeider

引用次数: 0

An Experimental Evaluation of Semidefinite Programming and Spectral Algorithms for Max Cut 最大切割的半定规划和谱算法的实验评价

Journal of Experimental Algorithmics Pub Date : 2023-07-15 DOI: 10.1145/3609426

Renee Mirka, David P. Williamson

引用次数: 3

A constructive heuristic for the uniform capacitated vertex k-center problem 一致容量顶点k-中心问题的构造性启发式算法

Journal of Experimental Algorithmics Pub Date : 2023-06-22 DOI: 10.1145/3604911

José Alejandro Cornejo Acosta, Jesús García Díaz, Julio César Pérez Sansalvador, R. Z. Ríos-Mercado, Saúl Eduardo Pomares Hernández

引用次数: 0

Algorithms for Efficiently Computing Structural Anonymity in Complex Networks 复杂网络中结构匿名性的高效计算算法

Journal of Experimental Algorithmics Pub Date : 2023-06-17 DOI: 10.1145/3604908

R. G. de Jong, Mark P. J. van der Loo, F. Takes

{"title":"Algorithms for Efficiently Computing Structural Anonymity in Complex Networks","authors":"R. G. de Jong, Mark P. J. van der Loo, F. Takes","doi":"10.1145/3604908","DOIUrl":"https://doi.org/10.1145/3604908","url":null,"abstract":"This paper proposes methods for efficiently computing the anonymity of entities in networks. We do so by partitioning nodes into equivalence classes where a node is k-anonymous if it is equivalent to k − 1 other nodes. This assessment of anonymity is crucial when one wants to share data and must ensure the anonymity of entities represented is compliant with privacy laws. Additionally, in such an assessment, it is necessary to account for a realistic amount of information in the hands of a possible attacker that attempts to de-anonymize entities in the network. However, measures introduced in earlier work often assume a fixed amount of attacker knowledge. Therefore, in this work, we use a new parameterized measure for anonymity called d-k-anonymity. This measure can be used to model the scenario where an attacker has perfect knowledge of a node’s surroundings up to a given distance d. This poses nontrivial computational challenges, as naive approaches would employ large numbers of possibly computationally expensive graph isomorphism checks. This paper proposes novel algorithms that severely reduce this computational burden. In particular, we present an iterative approach, assisted by techniques for preprocessing nodes that are trivially automorphic and heuristics that exploit graph invariants. We evaluate our algorithms on three well-known graph models and a wide range of empirical network datasets. Results show that our approaches significantly speed up the computation by multiple orders of magnitude, which allows one to compute d-k-anonymity for a range of meaningful values of d on large empirical networks with tens of thousands of nodes and over a million edges.","PeriodicalId":53707,"journal":{"name":"Journal of Experimental Algorithmics","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45345726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Fingerprinting-based minimal perfect hashing revisited 基于指纹的最小完美哈希重新审视

Journal of Experimental Algorithmics Pub Date : 2023-05-13 DOI: 10.1145/3596453

Piotr Beling

{"title":"Fingerprinting-based minimal perfect hashing revisited","authors":"Piotr Beling","doi":"10.1145/3596453","DOIUrl":"https://doi.org/10.1145/3596453","url":null,"abstract":"In the paper we study a fingerprint-based minimal perfect hash function (FMPH for short). While FMPH is not as space-efficient as some other minimal perfect hash functions (for example RecSplit, CHD, or PTHash), it has a number of practical advantages that make it worthy of consideration. FMPH is simple and quite fast to evaluate. Its construction requires very little auxiliary memory, takes a short time and, in addition, can be parallelized or carried out without holding keys in memory. In this paper, we propose an effective method (called FMPHGO) that reduces the size of FMPH, as well as a number of implementation improvements. In addition, we experimentally study FMPHGO performance and find the best values for its parameters. Our benchmarks show that with our method and an efficient structure to support the rank queries on a bit vector, the FMPH size can be reduced to about 2.1 bits/key, which is close to the size achieved by state-of-the-art methods and noticeably larger only compared to RecSplit. FMPHGO preserves most of the FMPH advantages mentioned above, but significantly reduces its construction speed. However, FMPHGO’s construction speed is still competitive with methods of similar space efficiency (like CHD or PTHash), and seems to be good enough for practical applications.","PeriodicalId":53707,"journal":{"name":"Journal of Experimental Algorithmics","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47195949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring 二元CSP冲突优化在平面子图最小分割及图着色中的应用

Journal of Experimental Algorithmics Pub Date : 2023-03-16 DOI: 10.1145/3588869

Loïc Crombez, G. D. D. Fonseca, Florian Fontan, Y. Gérard, A. Gonzalez-Lorenzo, P. Lafourcade, Luc Libralesso, B. Momège, Jack Spalding-Jamieson, Brandon Zhang, D. Zheng

引用次数: 3

A practical algorithm for volume estimation based on billiard trajectories and simulated annealing 一种基于台球轨迹和模拟退火的实用体积估计算法

Journal of Experimental Algorithmics Pub Date : 2023-03-03 DOI: 10.1145/3584182

Apostolos Chalkis, I. Emiris, Vissarion Fisikopoulos

引用次数: 3

Optimal Area Polygonization by Triangulation and Visibility Search 基于三角剖分和可见性搜索的最优区域多边形化

Journal of Experimental Algorithmics Pub Date : 2022-12-31 DOI: 10.1145/3503953

Julien Lepagnot, L. Moalic, Dominique Schmitt

引用次数: 1

Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks 基于增量多对一查询的道路网络a *快速严密启发式算法

Journal of Experimental Algorithmics Pub Date : 2022-11-30 DOI: 10.1145/3571282

Ben Strasser, Tim Zeitz

{"title":"Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks","authors":"Ben Strasser, Tim Zeitz","doi":"10.1145/3571282","DOIUrl":"https://doi.org/10.1145/3571282","url":null,"abstract":"We study exact, efficient, and practical algorithms for route planning applications in large road networks. On the one hand, such algorithms should be able to answer shortest path queries within milliseconds. On the other hand, routing applications often require integrating the current traffic situation, planning ahead with predictions for future traffic, respecting forbidden turns, and many other features depending on the specific application. Therefore, such algorithms must be flexible and able to support a variety of problem variants. In this work, we revisit the A* algorithm to build a simple, extensible, and unified algorithmic framework applicable to many route planning problems. A* has been previously used for routing in road networks. However, its performance was not competitive because no sufficiently fast and tight distance estimation function was available. We present a novel, efficient, and accurate A* heuristic using Contraction Hierarchies, another popular speedup technique. The core of our heuristic is a new Contraction Hierarchies query algorithm called Lazy RPHAST, which can efficiently compute shortest distances from many incrementally provided sources toward a common target. Additionally, we describe A* optimizations to accelerate the processing of low-degree vertices, which are typical in road networks, and present a new pruning criterion for symmetrical bidirectional A*. An extensive experimental study confirms the practicality of our approach for many applications.","PeriodicalId":53707,"journal":{"name":"Journal of Experimental Algorithmics","volume":" ","pages":"1 - 28"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44738989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5