Network Design Via Iterative Rounding Of Setpair Relaxations

Author： Cheriyan* Joseph Vempala† Santosh Vetta Adrian

ISSN： 0209-9683

Source： Combinatorica, Vol.26, Iss.3, 2006-06, pp. : 255-275

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Design of energy‐efficient cloud systems via network and resource virtualization

INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT (ELECTRONIC), Vol. 25, Iss. 2, 2015-03 ,pp. : 75-94

John Wiley & Sons Inc

Access to resources Recommend Favorite

Guaranteed systematic simulation of discrete‐time systems defined by polynomial expressions via convex relaxations

INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, Vol. 28, Iss. 3, 2018-02 ,pp. : 1062-1073

John Wiley & Sons Inc

Access to resources Recommend Favorite

Comparison of Iterative Methods for Computing the Pressure Field in a Dynamic Network Model

By Mogensen K.

Transport in Porous Media, Vol. 37, Iss. 3, 1999-12 ,pp. : 277-301

Springer Publishing Company

Access to resources Recommend Favorite

An Iterative Exact Solution for the Dual Power Management Problem in Wireless Sensor Network

By Jarray Fethi

Journal of Mathematical Modelling and Algorithms, Vol. 10, Iss. 2, 2011-06 ,pp. : 205-212

Springer Publishing Company

Access to resources Recommend Favorite

Bicriteria Network Design Problems

By Marathe M.V. Ravi R. Sundaram R. Ravi S.S. Rosenkrantz D.J. Hunt H.B.

Journal of Algorithms, Vol. 28, Iss. 1, 1998-07 ,pp. : 142-171

Academic Press

Access to resources Recommend Favorite