The following pages link to (Q5271449):
Displaying 31 items.
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- The complexity of routing with few collisions (Q1679978) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- Constant-factor approximations for capacitated arc routing without triangle inequality (Q1785236) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- The mixed Chinese postman problem parameterized by pathwidth and treedepth (Q2835842) (← links)
- Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
- The Arc Routing and Scheduling Problem with Transshipment (Q4408700) (← links)
- (Q4510100) (← links)
- The rescheduling arc routing problem (Q4601630) (← links)
- (Q4668751) (← links)
- (Q4762465) (← links)
- (Q4762467) (← links)
- Arc Routing Problems, Part I: The Chinese Postman Problem (Q4849324) (← links)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- (Q5271451) (← links)
- (Q5271452) (← links)
- (Q5271459) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
- Approximation algorithms for two clustered arc routing problems (Q6645185) (← links)
