Image de couverture de livre

Pointwise Lipschitz Continuous Graph Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Liu, Quanquan C., Velegkas, Grigoris, Yoshida, Yuichi, Zhou, Felix
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Lipschitz Continuous Algorithms for Covering Problems
par: Kumabe, Soh, et autres
Publié: (2023)

Courcelle's Theorem for Lipschitz Continuity
par: Gima, Tatsuya, et autres
Publié: (2025)

Sublinear Space Graph Algorithms in the Continual Release Model
par: Epasto, Alessandro, et autres
Publié: (2024)

Replicable Clustering
par: Esfandiari, Hossein, et autres
Publié: (2023)

Lipschitz Continuous Allocations for Optimization Games
par: Kumabe, Soh, et autres
Publié: (2024)

Replicable Learning of Large-Margin Halfspaces
par: Kalavasis, Alkis, et autres
Publié: (2024)

Differentially Private Language Generation and Identification in the Limit
par: Mehrotra, Anay, et autres
Publié: (2026)

Language Generation with Infinite Contamination
par: Mehrotra, Anay, et autres
Publié: (2025)

Tolerant Testing for Unique Games
par: Yoshida, Yuichi
Publié: (2026)

Lower Bounds for Testing Directed Acyclicity in the Unidirectional Bounded-Degree Model
par: Yoshida, Yuichi
Publié: (2026)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
par: Yoshida, Yuichi
Publié: (2026)

Testing Monotonicity of Real-Valued Functions on DAGs
par: Yoshida, Yuichi
Publié: (2026)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
par: Soma, Tasuku, et autres
Publié: (2025)

On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability
par: Kalavasis, Alkis, et autres
Publié: (2024)

On the Limits of Language Generation: Trade-Offs Between Hallucination and Mode Collapse
par: Kalavasis, Alkis, et autres
Publié: (2024)

Sensitivity Lower Bounds for Approximaiton Algorithms
par: Fleming, Noah, et autres
Publié: (2024)

What is Learnable in Valiant's Theory of the Learnable?
par: Hanneke, Steve, et autres
Publié: (2026)

An Algorithmic Approach to Address Course Enrollment Challenges
par: Biswas, Arpita, et autres
Publié: (2023)

Average sensitivity of the Knapsack Problem
par: Kumabe, Soh, et autres
Publié: (2024)

On Language Generation in the Limit with Bounded Memory
par: Kleinberg, Jon, et autres
Publié: (2026)

On the Learning Curves of Revenue Maximization
par: Hanneke, Steve, et autres
Publié: (2026)

Practical and Accurate Local Edge Differentially Private Graph Algorithms
par: Mundra, Pranay, et autres
Publié: (2025)

Non-Signaling Locality Lower Bounds for Dominating Set
par: Fleming, Noah, et autres
Publié: (2026)

Differentially Private Matchings
par: Dinitz, Michael, et autres
Publié: (2025)

Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism
par: Dhulipala, Laxman, et autres
Publié: (2025)

Low-Sensitivity Matching via Sampling from Gibbs Distributions
par: Yoshida, Yuichi, et autres
Publié: (2025)

From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model
par: Sakaue, Shinsaku, et autres
Publié: (2026)

Procurement Auctions via Approximately Optimal Submodular Optimization
par: Deng, Yuan, et autres
Publié: (2024)

A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
par: Zhu, Chenghao, et autres
Publié: (2025)

Graph-Based Algorithms for Diverse Similarity Search
par: Anand, Piyush, et autres
Publié: (2025)

Faster Algorithms for Graph Monopolarity
par: Philip, Geevarghese, et autres
Publié: (2024)

Coloring tournaments with few colors: Algorithms and complexity
par: Klingelhoefer, Felix, et autres
Publié: (2023)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

Succinct Graph Representations and Algorithmic Applications
par: Ullah, Ahammed, et autres
Publié: (2026)

Smoothed Analysis of Dynamic Graph Algorithms
par: Meir, Uri, et autres
Publié: (2025)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
par: Liu, Quanquan C., et autres
Publié: (2024)

Differentially Private Algorithms for Graphs Under Continual Observation
par: Fichtenberger, Hendrik, et autres
Publié: (2021)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)