Pages that link to "Item:Q1883342"
From MaRDI portal
The following pages link to Combinatorial Optimization. Polyhedra and efficiency. CD-ROM (Q1883342):
Displaying 50 items.
- Half-trek criterion for generic identifiability of linear structural equation models (Q116505) (← links)
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- Enhancing complex network controllability by minimum link direction reversal (Q315957) (← links)
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- Cardinality constrained combinatorial optimization: complexity and polyhedra (Q429646) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Approximating survivable networks with \(\beta \)-metric costs (Q553954) (← links)
- On the combinatorics of Galois numbers (Q607017) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- Faster algorithms for security games on matroids (Q666676) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- A characterization of oriented hypergraphic balance via signed weak walks (Q745211) (← links)
- Forecasting return products in an integrated forward/reverse supply chain utilizing an ANFIS (Q747428) (← links)
- Structural identifiability in low-rank matrix factorization (Q848955) (← links)
- Combinatorial optimization problems in wireless switch design (Q926564) (← links)
- Seeing the trees and their branches in the network is hard (Q935159) (← links)
- Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
- Covering a laminar family by leaf to leaf links (Q987693) (← links)
- A simple algorithm for edge-coloring bipartite multigraphs (Q1007547) (← links)
- On the representability of totally unimodular matrices on bidirected graphs (Q1044979) (← links)
- Complexity classification of the edge coloring problem for a family of graph classes (Q1675533) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem (Q1707826) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Oriented hypergraphs: balanceability (Q2124629) (← links)
- Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Reduced-form budget allocation with multiple public alternatives (Q2171860) (← links)
- Oriented hypergraphic matrix-tree type theorems and bidirected minors via Boolean order ideals (Q2313415) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- Graph realizations constrained by skeleton graphs (Q2363110) (← links)
- Submodularity and its application to some global constraints (Q2364363) (← links)
- On finite linear systems containing strict inequalities (Q2401512) (← links)
- Isomorphic coupled-task scheduling problem with compatibility constraints on a single processor (Q2434251) (← links)
- Small \(\ell\)-edge-covers in \(k\)-connected graphs (Q2446854) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- Envy-free pricing with general supply constraints for unit demand consumers (Q2637287) (← links)
- The signed \(k\)-submatchings in graphs (Q2637741) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS (Q3634201) (← links)
- Digital Deformable Model Simulating Active Contours (Q3648785) (← links)
