Author of the publication

Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.

, , , , and . Algorithmica, 31 (1): 58-78 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Obtaining online approximation algorithms for facility dispersion from offline algorithms., , and . Networks, 47 (4): 206-217 (2006)Reachability problems for sequential dynamical systems with threshold functions., , , , , and . Theor. Comput. Sci., (2003)Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications., and . Fundamental Problems in Computing, page 163-208. Springer, (2013)Predecessor and Permutation Existence Problems for Sequential Dynamical Systems., , , , , and . DMCS, volume AB of DMTCS Proceedings, page 69-80. DMTCS, (2003)JACM 1986-1990.. J. ACM, 50 (1): 18 (2003)Programmed Grammars and Classes of Formal Languages.. J. ACM, 16 (1): 107-131 (1969)Inferring Probabilistic Contagion Models Over Networks Using Active Queries., , , , , , and . CIKM, page 377-386. ACM, (2018)I/O Automata Based Verification of Finite State Distributed Systems: Complexity Issues (Abstract)., , , , and . PODC, page 122. ACM, (1996)Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems., , , , , and . CIAA, volume 9223 of Lecture Notes in Computer Science, page 21-34. Springer, (2015)A System Level Concurrency Control for Distributed Database Systems., , and . Berkeley Workshop, page 132-145. Technical Information Department, Lawrence Berkeley Laboratory, University of California, Berkeley CA, (1977)