The hardness of optimization problems on the weighted massively parallel computation model
type: Item
instance of: scholarly article
title: The hardness of optimization problems on the weighted massively parallel computation model
DOI: 10.1007/978-3-031-49193-1_9
author: Hengzhao Ma
author: Jianzhong Li
publication date: 2024-08-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7900436
zbMATH Keywords: massively parallel computation
zbMATH Keywords: weighted MPC model
zbMATH Keywords: communication cost optimization
MaRDI profile type: Publication
cites work: GYM: A Multiround Distributed Join Algorithm
cites work: Parallel algorithms for geometric graph problems
cites work: Communication Steps for Parallel Query Processing
cites work: The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
cites work: Constant-Round Spanners and Shortest Paths in Congested Clique and MPC
cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
cites work: Distributed Minimum Cut Approximation
cites work: Q5417679
description: scientific article; zbMATH DE number 7900436