Pages that link to "Item:Q4766817"
From MaRDI portal
The following pages link to Matching, Euler tours and the Chinese postman (Q4766817):
Displayed 50 items.
- Plane augmentation of plane graphs to meet parity constraints (Q2656724) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- The restricted Chinese postman problems with penalties (Q2670442) (← links)
- A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- (Q2741436) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs (Q2813347) (← links)
- The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth (Q2835842) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Strong product of factor-critical graphs (Q2885500) (← links)
- Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236) (← links)
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three (Q2960471) (← links)
- Search Games: A Review (Q2961390) (← links)
- Finding thet-join structure of graphs (Q3030603) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Test Prioritization at Different Modeling Levels (Q3079793) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- Patrolling a Pipeline (Q3179196) (← links)
- Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
- Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem (Q3186492) (← links)
- Better s-t-Tours by Gao Trees (Q3186497) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- Approximation Algorithms for the Single Robot Line Coverage Problem (Q3382005) (← links)
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs (Q3452560) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097) (← links)
- Adjacency on the Postman Polyhedron (Q3963041) (← links)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering (Q4284101) (← links)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
- T-joins in strongly connected hypergraphs (Q4597952) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- On Four Problems in Graph Theory (Q4722099) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- Eulerian location problems (Q4934874) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- Resistant Sets in the Unit Hypercube (Q4991667) (← links)
- (Q5005158) (← links)
- On Dyadic Fractional Packings of $T$-Joins (Q5043644) (← links)
- Reconstructing strings from substrings (Extended abstract) (Q5060147) (← links)
- Continuous Patrolling Games (Q5060487) (← links)
- Clean Clutters and Dyadic Fractional Packings (Q5071103) (← links)
- (Q5075801) (← links)
- On combinatorial properties of binary spaces (Q5101417) (← links)
- Minimum $T$-Joins and Signed-Circuit Covering (Q5112825) (← links)