Automata, Languages and Programming

DOI10.1007/11523468zbMath1084.90034OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716852

Martin Pál, Anupam Gupta

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Commitment under uncertainty: Two-stage stochastic matching problems ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ Combinatorial optimization in system configuration design

This page was built for publication: Automata, Languages and Programming