Pages that link to "Item:Q5300482"
From MaRDI portal
The following pages link to Efficient Algorithms for Eulerian Extension and Rural Postman (Q5300482):
Displaying 18 items.
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Finding even subgraphs even faster (Q1671994) (← links)
- A parameterized algorithmics framework for degree sequence completion problems in directed graphs (Q1739111) (← links)
- Using shortcut edges to maximize the number of triangles in graphs (Q1785441) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem (Q2181766) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- 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)
- Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
- Completing Partial Schedules for Open Shop with Unit Processing Times and Routing (Q5740178) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
- Switches in Eulerian graphs (Q6621269) (← links)
- Edge constrained Eulerian extensions (Q6629114) (← links)
