Pages that link to "Item:Q4706214"
From MaRDI portal
The following pages link to On Local Search and Placement of Meters in Networks (Q4706214):
Displaying 17 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Local search: is brute-force avoidable? (Q439931) (← links)
- On the directed full degree spanning tree problem (Q456701) (← links)
- The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT (Q456705) (← links)
- Two feedback problems for graphs with bounded tree-width (Q1764384) (← links)
- Parameterized complexity and local search approaches for the stable marriage problem with ties (Q1959726) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- On the complexity of restoring corrupted colorings (Q2424718) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Algorithms for placing monitors in a flow network (Q2441585) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Fixed-parameter tractability results for full-degree spanning tree and its dual (Q3057174) (← links)
- The degree-preserving spanning tree problem in strongly chordal and directed path graphs (Q3057180) (← links)
- A Moderately Exponential Time Algorithm for Full Degree Spanning Tree (Q3502671) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- Algorithms for Placing Monitors in a Flow Network (Q3638447) (← links)
- On the Directed Degree-Preserving Spanning Tree Problem (Q3656869) (← links)
