scientific article; zbMATH DE number 6382860

MaRDI QIDQ2935519zbMATH OpenFDO

Authors Zoltán Király, Péter Kovács

Publication date 30 December 2014

Full work available at URL https://arxiv.org/abs/1207.6381

zbMATH Keywords

network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cited in

(6)

• Min-cost-flow preserving bijection between subgraphs and orientations
• Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem
• A minimum cost network flow model for the maximum covering and patrol routing problem
• Characterization of random walks on space of unordered trees using efficient metric simulation
• Mean‐standard deviation model for minimum cost flow problem
• Data locality and replica aware virtual cluster embeddings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935519)