Copertina

A general framework for finding diverse solutions via network flow and its applications

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Iwamasa, Yuni, Matsuda, Tomoki, Morihira, Shunya, Sumita, Hanna
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Computing diverse pair of solutions for tractable SAT
di: Gima, Tatsuya, et al.
Pubblicazione: (2024)

Self-referential instances of the dominating set problem are irreducible
di: Zhou, Guangyan
Pubblicazione: (2026)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
di: Enright, Jessica, et al.
Pubblicazione: (2020)

Resilient functions: Optimized, simplified, and generalized
di: Ivanov, Peter, et al.
Pubblicazione: (2024)

Stable algorithms cannot reliably find isolated perceptron solutions
di: Gong, Shuyang, et al.
Pubblicazione: (2026)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
di: Björklund, Andreas, et al.
Pubblicazione: (2025)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
di: Sarkar, Rohit Sarma, et al.
Pubblicazione: (2024)

A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
di: Greilhuber, Jakob, et al.
Pubblicazione: (2026)

Characterizing Streaming Decidability of CSPs via Non-Redundancy
di: Sharma, Amatya, et al.
Pubblicazione: (2026)

Subset Balancing and Generalized Subset Sum via Lattices
di: Gao, Yiming, et al.
Pubblicazione: (2026)

Low-Sensitivity Matching via Sampling from Gibbs Distributions
di: Yoshida, Yuichi, et al.
Pubblicazione: (2025)

Counting Small Induced Subgraphs: Hardness via Fourier Analysis
di: Curticapean, Radu, et al.
Pubblicazione: (2024)

On the Complexity of Establishing Hereditary Graph Properties via Vertex Splitting
di: Firbas, Alexander, et al.
Pubblicazione: (2024)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
di: Jansen, Bart M. P., et al.
Pubblicazione: (2026)

Smooth Trade-off for Tensor PCA via Sharp Bounds for Kikuchi Matrices
di: Kothari, Pravesh K., et al.
Pubblicazione: (2025)

Weighted Pseudorandom Generators for Read-Once Branching Programs via Weighted Pseudorandom Reductions
di: Cheng, Kuan, et al.
Pubblicazione: (2025)

A Dichotomy Theorem for Multi-Pass Streaming CSPs
di: Fei, Yumou, et al.
Pubblicazione: (2025)

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

A Simple Proof that Ricochet Robots is PSPACE-Complete
di: Balanza-Martinez, Jose, et al.
Pubblicazione: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
di: Clinch, Katie, et al.
Pubblicazione: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
di: Lehner, Lisa, et al.
Pubblicazione: (2025)

A Space-space Trade-off for Directed st-Connectivity
di: Edenhofer, Roman
Pubblicazione: (2026)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
di: Gholizadeh, Hossein, et al.
Pubblicazione: (2025)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
di: Buhrman, Harry, et al.
Pubblicazione: (2025)

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
di: Kenig, Batya
Pubblicazione: (2025)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
di: Ducoffe, Guillaume
Pubblicazione: (2026)

A Unified Approach to Memory-Sample Tradeoffs for Detecting Planted Structures
di: Garg, Sumegha, et al.
Pubblicazione: (2026)

A tight quasi-polynomial bound for Global Label Min-Cut
di: Jaffke, Lars, et al.
Pubblicazione: (2022)

A New Information Complexity Measure for Multi-pass Streaming with Applications
di: Braverman, Mark, et al.
Pubblicazione: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
di: Bai, Tian, et al.
Pubblicazione: (2026)

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
di: Jansen, Klaus, et al.
Pubblicazione: (2025)

A lossless a priori splitting rule for split-delivery routing problems
di: Jones, Bo, et al.
Pubblicazione: (2025)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
di: S., Karthik C., et al.
Pubblicazione: (2023)

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
di: Yang, Yang
Pubblicazione: (2024)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
di: Grüttemeier, Niels, et al.
Pubblicazione: (2025)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
di: Greilhuber, Jakob, et al.
Pubblicazione: (2025)

The Trichotomy of Regular Property Testing
di: Bathie, Gabriel, et al.
Pubblicazione: (2025)

Downward self-reducibility in the total function polynomial hierarchy
di: Gajulapalli, Karthik, et al.
Pubblicazione: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
di: Fujie, Yuto, et al.
Pubblicazione: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
di: Moroie, Gregory
Pubblicazione: (2025)