Imagen de Portada

Algorithms for Group Closeness Centrality Maximization

Fuente: Zenodo

Guardado en:

Detalles Bibliográficos
Autor principal:	Ternes, Jakob
Formato:	Recurso digital
Publicado:	Zenodo 2025
Materias:	Algorithms Network Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Advances in Exact and Approximate Group Closeness Centrality Maximization
por: Schulz, Christian, et al.
Publicado: (2026)

Profit Maximization in Closed Social Networks
por: Sharma, Poonam, et al.
Publicado: (2026)

Equalizing Closeness Centralities via Edge Additions
por: Crane, Alex, et al.
Publicado: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
por: Spaeh, Fabian, et al.
Publicado: (2025)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
por: Amanatidis, Georgios, et al.
Publicado: (2024)

Fast Maximization of Current Flow Group Closeness Centrality
por: Xia, Haisong, et al.
Publicado: (2025)

Influence Maximization in Ising Models
por: Chen, Zongchen, et al.
Publicado: (2023)

Opinion Maximization in Social Networks by Modifying Internal Opinions
por: Wang, Gengyu, et al.
Publicado: (2025)

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
por: Zhang, Lingling, et al.
Publicado: (2024)

Maximal Closed Substrings
por: Badkobeh, Golnaz, et al.
Publicado: (2022)

Fast Estimation of Percolation Centrality
por: Cruciani, Antonio
Publicado: (2024)

Local Centrality Minimization with Quality Guarantees
por: Miyauchi, Atsushi, et al.
Publicado: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
por: Cruciani, Antonio, et al.
Publicado: (2025)

Temporal Betweenness Centrality on Shortest Walks Variants
por: Naima, Mehdi
Publicado: (2023)

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
por: Cruciani, Antonio
Publicado: (2023)

An Improved Modular Addition Checksum Algorithm
por: Koopman, Philip
Publicado: (2023)

Online Nash Welfare Maximization Without Predictions
por: Huang, Zhiyi, et al.
Publicado: (2022)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
por: Komoto, Kenta, et al.
Publicado: (2026)

Improved Algorithms for Fair Matroid Submodular Maximization
por: Mahabadi, Sepideh, et al.
Publicado: (2026)

On the External Validity of Average-Case Analyses of Graph Algorithms
por: Bläsius, Thomas, et al.
Publicado: (2022)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
por: Han, Seongjune, et al.
Publicado: (2026)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
por: You, Fangchen
Publicado: (2025)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
por: Chen, Jingbang, et al.
Publicado: (2024)

Robust Value Maximization in Challenge the Champ Tournaments with Probabilistic Outcomes
por: Bhaskar, Umang, et al.
Publicado: (2026)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
por: Armbruster, Alexander, et al.
Publicado: (2026)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
por: Zhu, Yanhui, et al.
Publicado: (2024)

A Competitive Algorithm for Throughput Maximization on Identical Machines
por: Moseley, Benjamin, et al.
Publicado: (2021)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
por: Cervenjak, Philip, et al.
Publicado: (2023)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
por: Chen, Wenjing, et al.
Publicado: (2023)

Efficient Algorithms to Compute Closed Substrings
por: Jain, Samkith K, et al.
Publicado: (2025)

On the Learning Curves of Revenue Maximization
por: Hanneke, Steve, et al.
Publicado: (2026)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
por: Brandt-Tumescheit, Fabian, et al.
Publicado: (2024)

A Grouped Sorting Queue Supporting Dynamic Updates for Timer Management in High-Speed Network Interface Cards
por: Wang, Zekun, et al.
Publicado: (2026)

The Long Arm of Nashian Allocation in Online $p$-Mean Welfare Maximization
por: Huang, Zhiyi, et al.
Publicado: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
por: Bressan, Marco, et al.
Publicado: (2026)

Maximizing Value in Challenge the Champ Tournaments
por: Bhaskar, Umang, et al.
Publicado: (2025)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
por: Cervenjak, Philip, et al.
Publicado: (2026)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Controlling the Spread of Epidemics on Networks with Differential Privacy
por: Nguyen, Dung, et al.
Publicado: (2025)