Pages that link to "Item:Q1386376"
From MaRDI portal
The following pages link to Approximating minimum feedback sets and multicuts in directed graphs (Q1386376):
Displaying 50 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- 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)
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
- Tradeoffs in process strategy games with application in the WDM reconfiguration problem (Q638539) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- An FPT algorithm for edge subset feedback edge set (Q763477) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
- On the complexity of crossings in permutations (Q1011761) (← 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)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- Kernels for deletion to classes of acyclic digraphs (Q1678165) (← links)
- Beyond rankings: comparing directed acyclic graphs (Q1715891) (← links)
- Combinatorial methods for invariance and safety of hybrid systems (Q1716585) (← links)
- Tiers for peers: a practical algorithm for discovering hierarchy in weighted networks (Q1741316) (← 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)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- Parameterised algorithms for deletion to classes of DAGs (Q2322699) (← links)
- Design of fixed points in Boolean networks using feedback vertex sets and model reduction (Q2325214) (← links)
- An improved exact algorithm for undirected feedback vertex set (Q2355979) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← 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)
- Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs (Q2813347) (← links)
- An Improved Exact Algorithm for Undirected Feedback Vertex Set (Q2867116) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Euler Digraphs (Q3120436) (← links)
- Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- The complexity of speedrunning video games (Q3301017) (← links)
- A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
- (Q3303471) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Iterative algorithms for generating minimal cutsets in directed graphs (Q3783817) (← links)
- (Q4637014) (← links)
- Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
