Design Is as Easy as Optimization

DOI10.1007/11786986_42MaRDI QIDQ3613783zbMATH OpenOpenAlexFDO

Authors Deeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani

Publication date 12 March 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Applications of game theory (91A80)

Recommendations

• Design is as easy as optimization
• scientific article; zbMATH DE number 3860908
• The design of approximation algorithms
• A problem reduction based approach to discrete optimization algorithm design
• A comparison of solutions to the minimal design problem

Cited in

(3)

• Design is as easy as optimization
• scientific article; zbMATH DE number 3860908 (Why is no real title available?)
• A problem reduction based approach to discrete optimization algorithm design

This page was built for publication: Design Is as Easy as Optimization

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