scientific article; zbMATH DE number 432790
From MaRDI portal
Publication:3138921
Cited in
(only showing first 100 items - show all)- A simple approximation algorithm for the weighted matching problem
- The Level-Ancestor problem on pure pointer machines
- Minimum entropy coloring
- Lexicographic bottleneck combinatorial problems
- A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
- Approximation algorithms for maximum dispersion
- A new variant of a vehicle routing problem: Lower and upper bounds
- An optimal algorithm for plane matchings in multipartite geometric graphs
- On residual approximation in solution extension problems
- Matchings with lower quotas: algorithms and complexity
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
- An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- A 3/2-approximation for big two-bar charts packing
- On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
- Linear-time parameterized algorithms with limited local resources
- Classes of linear programs solvable by coordinate-wise minimization
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- Paths and trails in edge-colored weighted graphs
- Priority matchings revisited
- Mix and match: a strategyproof mechanism for multi-hospital kidney exchange
- Succinct indices for path minimum, with applications
- Computing the bipartite edge frustration of fullerene graphs
- Paths and trails in edge-colored graphs
- Algorithms for solving the symmetry number problem on trees
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Weighted matching in the semi-streaming model
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- The traveling salesman problem on cubic and subcubic graphs
- On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
- Fast algorithms for the undirected negative cost cycle detection problem
- Randomized parameterized algorithms for the kidney exchange problem
- Dealing with several parameterized problems by random methods
- Optimal on-line decremental connectivity in trees
- Approximate Max k-Cut with subgraph guarantee
- Parallel approximation algorithms for maximum weighted matching in general graphs
- Linear time approximation algorithms for~degree~constrained subgraph problems
- Parameterized and approximation algorithms for finding two disjoint matchings
- Near approximation of maximum weight matching through efficient weight reduction
- Linear programming in the semi-streaming model with application to the maximum matching problem
- Gallai-Edmonds decomposition as a pruning technique
- Linear-time approximation for maximum weight matching
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
- On the power of tree-depth for fully polynomial FPT algorithms
- Fast and Simple Algorithms for Weighted Perfect Matching
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Node-balancing by edge-increments
- Path Minima in Incremental Unrooted Trees
- Properly coloured cycles and paths: Results and open problems
- The density maximization problem in graphs
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- Finding dominators via disjoint set union
- On vertex independence number of uniform hypergraphs
- Computing convex quadrangulations
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
- Partitioning planar graphs: a fast combinatorial approach for max-cut
- scientific article; zbMATH DE number 1759463 (Why is no real title available?)
- Parallel static and dynamic multi‐constraint graph partitioning
- A simple reduction from maximum weight matching to maximum cardinality matching
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Improved algorithms for several parameterized problems based on random methods
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
- Weighted well-covered claw-free graphs
- Weighted matching as a generic pruning technique applied to optimization constraints
- Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
- A Hybrid Approach to Fast Indirect Quadrilateral Mesh Generation
- Parallel dynamic lowest common ancestors
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
- Minimum weight euclidean matching and weighted relative neighborhood graphs
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- Clustering in Hypergraphs to Minimize Average Edge Service Time
- Fast incremental planarity testing
- Maintenance of triconnected components of graphs
- Age-based preferences in paired kidney exchange
- Network-based vertex dissolution
- Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
- Paths and Trails in Edge-Colored Graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Efficient algorithms for maximum weight matchings in general graphs with small edge weights
- A scaling algorithm for maximum weight matching in bipartite graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Algorithms for four variants of the exact satisfiability problem
- The balanced maximally diverse grouping problem with attribute values
- Minimum weighted clique cover on claw‐free perfect graphs
- The difficulty of beating the Taxman
- On matchings, T‐joins, and arc routing in road networks
- Solving maximum weighted matching on large graphs with deep reinforcement learning
- Shortest odd paths in undirected graphs with conservative weight functions
- Good \(r\)-divisions imply optimal amortized decremental biconnectivity
- Computing solutions for matching games
- Euclidean maximum matchings in the plane -- local to global
- Dynamic longest common substring in polylogarithmic time
- Maintenance of 2- and 3-edge-connected components of graphs. I
- Approximation algorithms for multiple terminal, Hamiltonian path problems
- A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
- Protecting the connectivity of a graph under non-uniform edge failures
- On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
- Protecting the connectivity of a graph under nonuniform edge failures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138921)
