A generalized matching reconfiguration problem
From MaRDI portal
Cites work
- (1 + )-approximate incremental matching in constant deterministic amortized time
- A 2-competitive algorithm for online convex optimization with switching costs
- A deamortization approach for dynamic spanner and dynamic maximal matching
- A theory and algorithms for combinatorial reoptimization
- A tight bound for shortest augmenting paths on trees
- Complexity and approximation in reoptimization
- Complexity of independent set reconfigurability problems
- Cost-oblivious storage reallocation
- Dynamic graph connectivity in polylogarithmic worst case time
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
- Fast reoptimization for the minimum spanning tree problem
- Faster fully dynamic matchings with small approximation ratios
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Fully dynamic (1+ e)-approximate matchings
- Fully dynamic almost-maximal matching: breaking the polynomial worst-case time barrier
- Fully dynamic approximate maximum matching and minimum vertex cover in O(^3 n) worst case update time
- Fully dynamic matching in bipartite graphs
- Fully dynamic maximal independent set with sublinear update time
- Fully dynamic maximal matching in constant update time
- Fully Dynamic Maximal Matching in O (log n) Update Time
- scientific article; zbMATH DE number 2086639 (Why is no real title available?)
- Introduction to reconfiguration
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Maintaining a large matching and a small vertex cover
- Maintaining assignments online: matching, scheduling, and flows
- New algorithms for Steiner tree reoptimization
- On fully dynamic graph sparsifiers
- On the complexity of optimal matching reconfiguration
- On the complexity of reconfiguration problems
- Online and dynamic algorithms for set cover
- Online bipartite matching in offline time
- Online maximum matching with recourse
- Online perfect matching and mobile computing
- Online Steiner tree with deletions
- Optimal dynamic distributed MIS
- Randomized composable core-sets for distributed submodular maximization
- Reallocation problems in scheduling
- Reconfiguration of maximum-weight b-matchings in a graph
- Reoptimization of minimum and maximum traveling salesman's tours
- Reoptimization of the shortest common superstring problem
- Rounding dynamic matchings against an adaptive adversary
- Shortest augmenting paths for online matchings on trees
- Shortest reconfiguration of matchings
- Shortest reconfiguration of perfect matchings via alternating cycles
- Simple deterministic algorithms for fully dynamic maximal matching
- Simultaneously load balancing for every p-norm, with reassignments
- The complexity of change
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
- The Perfect Matching Reconfiguration Problem
- The power of deferral: maintaining a constant-competitive Steiner tree online
- The power of recourse for online MST and TSP
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
This page was built for publication: A generalized matching reconfiguration problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229346)
