On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Kumar, Rinku, Mazumdar, Bodhisatwa, Mandal, Subhrangsu |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
by: Tayal, Mumuksh
Published: (2025)
by: Tayal, Mumuksh
Published: (2025)
Fixed-Parameter Tractability of Hedge Cut
by: Fomin, Fedor V., et al.
Published: (2024)
by: Fomin, Fedor V., et al.
Published: (2024)
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
by: Pilipczuk, Michał, et al.
Published: (2025)
by: Pilipczuk, Michał, et al.
Published: (2025)
Fixed-Parameter Tractable Submodular Maximization over a Matroid
by: Nematollahi, Shamisa, et al.
Published: (2025)
by: Nematollahi, Shamisa, et al.
Published: (2025)
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)
by: Mizutani, Yosuke, et al.
Published: (2024)
Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
by: Sharma, Vidya Sagar
Published: (2023)
by: Sharma, Vidya Sagar
Published: (2023)
Homogeneous Network Caching is Fixed-Parameter Tractable Parameterized by the Number of Caches
by: Pintér, József, et al.
Published: (2026)
by: Pintér, József, et al.
Published: (2026)
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
by: Haviv, Ishay
Published: (2022)
by: Haviv, Ishay
Published: (2022)
A Framework for Parameterized Subexponential-Subcubic-Time Algorithms for Weighted Problems in Planar Graphs
by: Bentert, Matthias, et al.
Published: (2026)
by: Bentert, Matthias, et al.
Published: (2026)
Beer Path Problems in Temporal Graphs
by: D'Ascenzo, Andrea, et al.
Published: (2025)
by: D'Ascenzo, Andrea, et al.
Published: (2025)
A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
by: Chen, Kuowen, et al.
Published: (2025)
by: Chen, Kuowen, et al.
Published: (2025)
A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
by: Kwok, Shawxing
Published: (2025)
by: Kwok, Shawxing
Published: (2025)
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
by: de Colnet, Alexis, et al.
Published: (2026)
by: de Colnet, Alexis, et al.
Published: (2026)
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
by: Baste, Julien, et al.
Published: (2019)
by: Baste, Julien, et al.
Published: (2019)
A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
by: Sharma, Vidya Sagar
Published: (2023)
by: Sharma, Vidya Sagar
Published: (2023)
Matching Composition and Efficient Weight Reduction in Dynamic Matching
by: Bernstein, Aaron, et al.
Published: (2024)
by: Bernstein, Aaron, et al.
Published: (2024)
A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time
by: Mahabadi, Sepideh, et al.
Published: (2025)
by: Mahabadi, Sepideh, et al.
Published: (2025)
From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
by: Bernstein, Aaron, et al.
Published: (2025)
by: Bernstein, Aaron, et al.
Published: (2025)
Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
by: Henzinger, Monika, et al.
Published: (2024)
by: Henzinger, Monika, et al.
Published: (2024)
Matching and Edge Cover in Temporal Graphs
by: Cioni, Lapo, et al.
Published: (2025)
by: Cioni, Lapo, et al.
Published: (2025)
Pattern Matching under Weighted Edit Distance
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)
Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
by: Chen, Yong, et al.
Published: (2025)
by: Chen, Yong, et al.
Published: (2025)
Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)
by: Deligkas, Argyrios, et al.
Published: (2021)
On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
by: Bousquet, Nicolas, et al.
Published: (2025)
by: Bousquet, Nicolas, et al.
Published: (2025)
Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics
by: Jana, Saswata, et al.
Published: (2026)
by: Jana, Saswata, et al.
Published: (2026)
A PTAS for Weighted Triangle-free 2-Matching
by: Bosch-Calvo, Miguel, et al.
Published: (2026)
by: Bosch-Calvo, Miguel, et al.
Published: (2026)
Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
by: Ferdous, S M, et al.
Published: (2023)
by: Ferdous, S M, et al.
Published: (2023)
On the Online Weighted Non-Crossing Matching Problem
by: Boyar, Joan, et al.
Published: (2026)
by: Boyar, Joan, et al.
Published: (2026)
Binary $k$-Center with Missing Entries: Structure Leads to Tractability
by: Soheil, Farehe, et al.
Published: (2025)
by: Soheil, Farehe, et al.
Published: (2025)
Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
by: Kanellopoulos, Sotiris, et al.
Published: (2026)
by: Kanellopoulos, Sotiris, et al.
Published: (2026)
Sublinear Time Algorithm for Online Weighted Bipartite Matching
by: Hu, Hang, et al.
Published: (2022)
by: Hu, Hang, et al.
Published: (2022)
Enhanced Graph Pattern Matching
by: Cotumaccio, Nicola
Published: (2024)
by: Cotumaccio, Nicola
Published: (2024)
Weighted Matching in the Random-Order Streaming and Robust Communication Models
by: Hashemi, Diba, et al.
Published: (2024)
by: Hashemi, Diba, et al.
Published: (2024)
Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
by: Zheng, Da Wei, et al.
Published: (2023)
by: Zheng, Da Wei, et al.
Published: (2023)
Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
by: Holtgrefe, Niels, et al.
Published: (2026)
by: Holtgrefe, Niels, et al.
Published: (2026)
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Blossom VI: A Practical Minimum Weight Perfect Matching Algorithm
by: Arkhipov, Pavel, et al.
Published: (2026)
by: Arkhipov, Pavel, et al.
Published: (2026)
Online Matching in Geometric Random Graphs
by: Sentenac, Flore, et al.
Published: (2023)
by: Sentenac, Flore, et al.
Published: (2023)
Graph Exploration with Edge Weight Estimates
by: Gehnen, Matthias, et al.
Published: (2025)
by: Gehnen, Matthias, et al.
Published: (2025)
Temporal Graph Reconfiguration for Always-Connected Graphs
by: Sievers, Paul, et al.
Published: (2025)
by: Sievers, Paul, et al.
Published: (2025)
Similar Items
-
A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
by: Tayal, Mumuksh
Published: (2025) -
Fixed-Parameter Tractability of Hedge Cut
by: Fomin, Fedor V., et al.
Published: (2024) -
Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
by: Pilipczuk, Michał, et al.
Published: (2025) -
Fixed-Parameter Tractable Submodular Maximization over a Matroid
by: Nematollahi, Shamisa, et al.
Published: (2025) -
Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
by: Mizutani, Yosuke, et al.
Published: (2024)