Approximations for Fault-Tolerant Total and Partial Positive Influence Domination
Fuente:
arXiv
Saved in:
| Main Authors: | Lamprou, Ioannis, Sigalas, Ioannis, Vaxevanakis, Ioannis, Zissimopoulos, Vassilis |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
by: Driemel, Anne, et al.
Published: (2026)
by: Driemel, Anne, et al.
Published: (2026)
Optimizations and extensions for fair join pattern matching
by: Karras, Ioannis
Published: (2025)
by: Karras, Ioannis
Published: (2025)
Parameterized Linear Time Transitive Closure
by: Kritikakis, Giorgos, et al.
Published: (2024)
by: Kritikakis, Giorgos, et al.
Published: (2024)
Fault-Tolerant Approximate Distance Oracles with a Source Set
by: Dey, Dipan, et al.
Published: (2025)
by: Dey, Dipan, et al.
Published: (2025)
Concurrent Double-Ended Priority Queues
by: Fatourou, Panagiota, et al.
Published: (2025)
by: Fatourou, Panagiota, et al.
Published: (2025)
Learning the Inverse Temperature of Ising Models under Hard Constraints using One Sample
by: Chauhan, Rohan, et al.
Published: (2025)
by: Chauhan, Rohan, et al.
Published: (2025)
Random Natural Gradient
by: Kolotouros, Ioannis, et al.
Published: (2023)
by: Kolotouros, Ioannis, et al.
Published: (2023)
A near-linear time approximation scheme for $(k,\ell)$-median clustering under discrete Fréchet distance
by: Driemel, Anne, et al.
Published: (2025)
by: Driemel, Anne, et al.
Published: (2025)
Faster Approximation Algorithms for k-Center via Data Reduction
by: Filtser, Arnold, et al.
Published: (2025)
by: Filtser, Arnold, et al.
Published: (2025)
Fault-Tolerant ST-Diameter Oracles
by: Bilò, Davide, et al.
Published: (2023)
by: Bilò, Davide, et al.
Published: (2023)
Fault-Tolerant Bounded Flow Preservers
by: Bansal, Shivam, et al.
Published: (2024)
by: Bansal, Shivam, et al.
Published: (2024)
Exact Learning of Weighted Graphs Using Composite Queries
by: Goodrich, Michael T., et al.
Published: (2025)
by: Goodrich, Michael T., et al.
Published: (2025)
The Query Complexity of Local Search in Rounds on General Graphs
by: Brânzei, Simina, et al.
Published: (2026)
by: Brânzei, Simina, et al.
Published: (2026)
The Computational Complexity of Avoiding Strict Saddle Points in Constrained Optimization
by: Kontogiannis, Andreas, et al.
Published: (2026)
by: Kontogiannis, Andreas, et al.
Published: (2026)
An Optimal $3$-Fault-Tolerant Connectivity Oracle
by: Kosinas, Evangelos
Published: (2025)
by: Kosinas, Evangelos
Published: (2025)
Sublinear Edge Fault Tolerant Spanners for Hypergraphs
by: He, Jialin, et al.
Published: (2025)
by: He, Jialin, et al.
Published: (2025)
Nearly Optimal Fault Tolerant Distance Oracle
by: Dey, Dipan, et al.
Published: (2024)
by: Dey, Dipan, et al.
Published: (2024)
Beyond the worst case: Distortion in impartial culture electorates
by: Caragiannis, Ioannis, et al.
Published: (2023)
by: Caragiannis, Ioannis, et al.
Published: (2023)
Near-Optimal Fault-Tolerant Strong Connectivity Preservers
by: Hoppenworth, Gary, et al.
Published: (2025)
by: Hoppenworth, Gary, et al.
Published: (2025)
Near Optimal Dual Fault Tolerant Distance Oracle
by: Dey, Dipan, et al.
Published: (2024)
by: Dey, Dipan, et al.
Published: (2024)
Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
by: Bilò, Davide, et al.
Published: (2024)
by: Bilò, Davide, et al.
Published: (2024)
Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
by: Bhanja, Koustav, et al.
Published: (2025)
by: Bhanja, Koustav, et al.
Published: (2025)
Parks and Recreation: Color Fault-Tolerant Spanners Made Local
by: Parter, Merav, et al.
Published: (2024)
by: Parter, Merav, et al.
Published: (2024)
Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
by: Khanna, Sanjeev, et al.
Published: (2026)
by: Khanna, Sanjeev, et al.
Published: (2026)
Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
by: Andersen, Martin Jupakkal, et al.
Published: (2025)
by: Andersen, Martin Jupakkal, et al.
Published: (2025)
Fault-Tolerant Matroid Bases
by: Bentert, Matthias, et al.
Published: (2025)
by: Bentert, Matthias, et al.
Published: (2025)
Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
by: Parter, Merav, et al.
Published: (2025)
by: Parter, Merav, et al.
Published: (2025)
Approximations and Hardness of Packing Partially Ordered Items
by: Doron-Arad, Ilan, et al.
Published: (2024)
by: Doron-Arad, Ilan, et al.
Published: (2024)
Approximation Algorithms for Network Design in Non-Uniform Fault Models
by: Chekuri, Chandra, et al.
Published: (2024)
by: Chekuri, Chandra, et al.
Published: (2024)
A Query-Driven Approach to Space-Efficient Range Searching
by: Fotakis, Dimitris, et al.
Published: (2025)
by: Fotakis, Dimitris, et al.
Published: (2025)
The Distortion of Prior-Independent b-Matching Mechanisms
by: Caragiannis, Ioannis, et al.
Published: (2026)
by: Caragiannis, Ioannis, et al.
Published: (2026)
On Interim Envy-Free Allocation Lotteries
by: Caragiannis, Ioannis, et al.
Published: (2021)
by: Caragiannis, Ioannis, et al.
Published: (2021)
Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons
by: Vahidi, Soroush, et al.
Published: (2024)
by: Vahidi, Soroush, et al.
Published: (2024)
Big data applications on small quantum computers
by: Yogendran, Boniface, et al.
Published: (2024)
by: Yogendran, Boniface, et al.
Published: (2024)
Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
by: Solomon, Shay, et al.
Published: (2023)
by: Solomon, Shay, et al.
Published: (2023)
An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
by: Kurita, Kazuhiro, et al.
Published: (2022)
by: Kurita, Kazuhiro, et al.
Published: (2022)
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
by: Caragiannis, Ioannis, et al.
Published: (2026)
by: Caragiannis, Ioannis, et al.
Published: (2026)
Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
by: Fischer, Nick, et al.
Published: (2026)
by: Fischer, Nick, et al.
Published: (2026)
The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
by: Greilhuber, Jakob, et al.
Published: (2025)
by: Greilhuber, Jakob, et al.
Published: (2025)
Similar Items
-
Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
by: Driemel, Anne, et al.
Published: (2026) -
Optimizations and extensions for fair join pattern matching
by: Karras, Ioannis
Published: (2025) -
Parameterized Linear Time Transitive Closure
by: Kritikakis, Giorgos, et al.
Published: (2024) -
Fault-Tolerant Approximate Distance Oracles with a Source Set
by: Dey, Dipan, et al.
Published: (2025) -
Concurrent Double-Ended Priority Queues
by: Fatourou, Panagiota, et al.
Published: (2025)