Pages that link to "Item:Q3936213"
From MaRDI portal
The following pages link to The complexity of restricted spanning tree problems (Q3936213):
Displaying 50 items.
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems (Q533792) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- On computing the minimum 3-path vertex cover and dissociation number of graphs (Q650941) (← links)
- Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- A faster FPT algorithm for 3-path vertex cover (Q903365) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Exact arborescences, matchings and cycles (Q1095157) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Optimizing over a slice of the bipartite matching polytope (Q1111947) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- Corrigendum to ``The complexity of cubical graphs'' (Q1825039) (← links)
- Heuristic and exact algorithms for the spanning tree detection problem (Q1885939) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Isomorphic tree spanner problems (Q1899446) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (Q2076286) (← links)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
- Knapsack problem with objective value gaps (Q2361124) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- Integrality gaps for colorful matchings (Q2419586) (← links)
- Almost exact matchings (Q2429356) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- Group control for consent rules with consecutive qualifications (Q2682019) (← links)
- The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes (Q2840556) (← links)
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover (Q2988857) (← links)
- Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- Cooperation in Multiorganization Matching (Q3602831) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- Balanced spanning forests and trees (Q3984286) (← links)
- On the difficulty of finding walks of length k (Q4385673) (← links)
- Simple paths with exact and forbidden lengths (Q4562938) (← links)
- Uniformly dissociated graphs (Q4604516) (← links)
- Generalized Center Problems with Outliers (Q4972687) (← links)
- (Q5002700) (← links)
- General d-position sets (Q5013341) (← links)
