scientific article

zbMath1304.68203arXiv1207.6381MaRDI QIDQ2935519

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

Publication date: 30 December 2014

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

network

Mathematics Subject Classification ID

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

Related Items (6)

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

This page was built for publication: