Pages that link to "Item:Q1101013"
From MaRDI portal
The following pages link to An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013):
Displaying 50 items.
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
- Polynomial-time data reduction for weighted problems beyond additive goal functions (Q2685700) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
- A unified approach to optimal estimation using diophantine equations (Q4036071) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- (Q4761161) (← links)
- Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs (Q5002764) (← links)
- (Q5005108) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Even circuits in oriented matroids (Q5052170) (← links)
- Target Set Selection in Dense Graph Classes (Q5062113) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5089202) (← links)
- (Q5090494) (← links)
- (Q5092485) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Parameterized Resiliency Problems via Integer Linear Programming (Q5283365) (← links)
- (Q5381125) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- (Q5874519) (← links)
- Tensors in computations (Q5887832) (← links)
- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs (Q5891702) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- Subgraph isomorphism on graph classes that exclude a substructure (Q5919029) (← links)
- A lower bound for the shortest path problem (Q5956014) (← links)
- Dynamic coloring on restricted graph classes (Q6057319) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- 0/1-Integer programming: Optimization and Augmentation are equivalent (Q6102323) (← links)
