Pages that link to "Item:Q1894706"
From MaRDI portal
The following pages link to Packing directed circuits fractionally (Q1894706):
Displaying 34 items.
- Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
- The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Approximation algorithms for the Bipartite Multicut problem (Q991784) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- Models for concurrent product and process design (Q1046061) (← links)
- A unified approximation algorithm for node-deletion problems (Q1270821) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Packing directed circuits (Q1375699) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Positive and negative cycles in Boolean networks (Q1717061) (← links)
- Polynomial kernels for deletion to classes of acyclic digraphs (Q1751231) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← links)
- Target set selection for conservative populations (Q2235265) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
- Understanding planning with incomplete information and sensing (Q2457676) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- (Q3303471) (← links)
- (Q5075819) (← links)
- (Q5111250) (← links)
- The connection of the acyclic disconnection and feedback arc sets -- on an open problem of Figueroa et al.. (Q6494939) (← links)
