Imagen de Portada

The Densest SWAMP problem: subhypergraphs with arbitrary monotonic partial edge rewards

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bengali, Vedangi, Tatti, Nikolaj, Kumpulainen, Iiro, Adriaens, Florian, Veldt, Nate
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Improved Hardness and Approximations for Cardinality-Based Minimum $s$-$t$ Cuts Problems in Hypergraphs
por: Adriaens, Florian, et al.
Publicado: (2024)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

On the tractability and approximability of non-submodular cardinality-based $s$-$t$ cut problems in hypergraphs
por: Bengali, Vedangi, et al.
Publicado: (2024)

Finding coherent node groups in directed graphs
por: Kumpulainen, Iiro, et al.
Publicado: (2023)

Dense Subgraph Discovery Meets Strong Triadic Closure
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

Fair Diversity Maximization with Few Representatives
por: Adriaens, Florian, et al.
Publicado: (2025)

Multilayer Correlation Clustering
por: Miyauchi, Atsushi, et al.
Publicado: (2024)

Simple Algorithms for Bad Triangle Transversals with Applications to Correlation Clustering
por: Adriaens, Florian, et al.
Publicado: (2026)

Approximating splits for decision trees quickly in sparse data streams
por: Tatti, Nikolaj
Publicado: (2026)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
por: Huang, Yufan, et al.
Publicado: (2023)

A Simple and Fast $(3+\varepsilon)$-approximation for Constrained Correlation Clustering
por: Veldt, Nate
Publicado: (2025)

Node ranking in labeled networks
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

Fair densest subgraph across multiple graphs
por: Arachchi, Chamalee Wickrama, et al.
Publicado: (2025)

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

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

Destroying Densest Subgraphs is Hard
por: Bazgan, Cristina, et al.
Publicado: (2024)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
por: Paul-Pena, Daniel, et al.
Publicado: (2025)

Scalable $k$-clique Densest Subgraph Search
por: Ye, Xiaowei, et al.
Publicado: (2024)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
por: Mitrović, Slobodan, et al.
Publicado: (2025)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
por: Tu, Sijing, et al.
Publicado: (2025)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
por: Xu, Xiaojia, et al.
Publicado: (2024)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
por: Balmaseda, Vicente, et al.
Publicado: (2024)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
por: Hochbaum, Dorit S., et al.
Publicado: (2025)

Fast and Simple Densest Subgraph with Predictions
por: Bui, Thai, et al.
Publicado: (2025)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
por: Nguyen, Ta Duy, et al.
Publicado: (2024)

In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024)

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs
por: Fox, Emily
Publicado: (2023)

A Survey on the Densest Subgraph Problem and Its Variants
por: Lanciano, Tommaso, et al.
Publicado: (2023)

A Note on Approximability of Densest At-Least-k-Subgraph
por: Laekhanukit, Bundit, et al.
Publicado: (2026)

Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
por: Veldt, Nate, et al.
Publicado: (2026)

Efficient Processing of Subsequent Densest Subgraph Query
por: Hung, Chia-Yang, et al.
Publicado: (2024)

Scalable Temporal Motif Densest Subnetwork Discovery
por: Sarpe, Ilie, et al.
Publicado: (2024)

Tighter Bounds for Local Differentially Private Core Decomposition and Densest Subgraph
por: Henzinger, Monika, et al.
Publicado: (2024)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
por: Lu, Qiheng, et al.
Publicado: (2025)

Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
por: Veldt, Nate, et al.
Publicado: (2025)

Algorithmic study on liar's vertex-edge domination problem
por: Bhattacharya, Debojyoti, et al.
Publicado: (2023)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
por: Jaberi, Raed, et al.
Publicado: (2024)

Improved bounds for group testing in arbitrary hypergraphs
por: De Bonis, Annalisa
Publicado: (2024)