Pages that link to "Item:Q3503231"
From MaRDI portal
The following pages link to Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems (Q3503231):
Displaying 8 items.
- Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- A note on M-convex functions on jump systems (Q2217499) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids (Q6180564) (← links)