|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
P. BERMAN, M. FURER AND A. Z~.MKOVSKY, "Applications of the Matroid Parity Problem to Approximating Steiner Trees", Tech. Rep. 980021, Computer Science Dept., UCLA, Los Angeles, 1998.
|
| |
4
|
|
| |
5
|
|
 |
6
|
Andrew E. Caldwell , Andrew B. Kahng , Stefanus Mantik , Igor L. Markov , Alex Zelikovsky, On wirelength estimations for row-based placement, Proceedings of the 1998 international symposium on Physical design, p.4-11, April 06-08, 1998, Monterey, California, United States
[doi> 10.1145/274535.274536]
|
| |
7
|
A. El. F. CLEMENT1 AND L. TREVISAN, "Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints", Electronic Colloquium on Computational Complexity, TR96-016 (1996).
|
| |
8
|
M.R. Garey, D. S. Johnson. '~The Rectilinear Steiner Problem is NP-Complete', SIAM J. Appl. Math., 32, 826-834, 1977.
|
| |
9
|
J. GRIFFITH, G. ROBINS, J. S. SALOWE, AND T. ZHANG, Closing the Gap: Near-Optimal Steiner Trees in Polynomial Time, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13 (1994), pp. 1351-1365.
|
| |
10
|
|
| |
11
|
F. K. Hwang, D. S. Richaxds, and P. Winter. The Steiner Tree Problem, North-Holland, 1992.
|
| |
12
|
B. Korte, H. J. PrSmel, A. Steger. "Steiner Trees in VLSI-Layouts', In Korte et al.: Paths, Flows and VLSI-Layout, Springer, 1990.
|
| |
13
|
A. B. KAHNG AND O. ROBL~S, "A New Class of Iterative Steiner Tree Heuristics With Good Performance", IEEE Transactions on Computer-Aided Design, 11 (7), 1992, pp. 893-902.
|
| |
14
|
A. B. KAHNG AND G. ROBL~S, On Optimal Intereonneetions for VLSI, Kluwer Publishers, 1995.
|
| |
15
|
M. KAa~XNSKI AND A. ZELIKOVSK~, "New Approximation Algorithms for the Steiner Tree Problem", Journal of Combinatorial Optimization, i (1997), 47-65.
|
| |
16
|
L. LOVASZ AND M. D. PLUMMER, Matching Theory. Elsevier Science, Amsterdam, 1986.
|
| |
17
|
I. I. MANDOXU, V. V. VAzm~r~I AND J. L. GANLEY, "A New Heuristic for Reetilineax Steiner Trees", manuscript.
|
| |
18
|
|
| |
19
|
|
| |
20
|
H. TAKAHASHI AND A. MATSUVA~tA, "An Approximate Solution for the Steiner Problem in Graphs", Math. .Tap. ~4 (1980), 573-577.
|
| |
21
|
A. ZELIKOVSKY, "An 11/6-Approximation Algorithm for the Network Steiner Problem", Algorithmica 9 (1993), 463-470.
|
| |
22
|
|
CITED BY 54
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Elliot Anshelevich , Anirban Dasgupta , Eva Tardos , Tom Wexler, Near-optimal network design with selfish agents, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Anupam Gupta , Jon Kleinberg , Amit Kumar , Rajeev Rastogi , Bulent Yener, Provisioning a virtual private network: a network design problem for multicommodity flow, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.389-398, July 2001, Hersonissos, Greece
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Anupam Gupta , Martin Pál , R. Ravi , Amitabh Sinha, Boosted sampling: approximation algorithms for stochastic optimization, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, June 13-16, 2004, Chicago, IL, USA
|
|
|
Ming-Yang Kao , Xiang-Yang Li , WeiZhao Wang, Towards truthful mechanisms for binary demand games: a general framework, Proceedings of the 6th ACM conference on Electronic commerce, p.213-222, June 05-08, 2005, Vancouver, BC, Canada
|
|
|
Guoliang Xing , Chenyang Lu , Ying Zhang , Qingfeng Huang , Robert Pless, Minimum power configuration in wireless sensor networks, Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing, May 25-27, 2005, Urbana-Champaign, IL, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
E. Althaus , G. Calinescu , I. I. Mandoiu , S. Prasad , N. Tchervenski , A. Zelikovsky, Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks, Wireless Networks, v.12 n.3, p.287-299, May 2006
|
|
|
|
|
|
Umakishore Ramachandran , Rajnish Kumar , Matthew Wolenetz , Brian Cooper , Bikash Agarwalla , Junsuk Shin , Phillip Hutto , Arnab Paul, Dynamic data fusion for future sensor networks, ACM Transactions on Sensor Networks (TOSN), v.2 n.3, p.404-443, August 2006
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Friedrich Eisenbrand , Fabrizio Grandoni , Thomas Rothvoß , Guido Schäfer, Approximating connected facility location problems via random facility sampling and core detouring, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, p.1174-1183, January 20-22, 2008, San Francisco, California
|
|
|
Alan Frieze , Jon Kleinberg , R. Ravi , Warren Debany, Line-of-sight networks, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, p.968-977, January 07-09, 2007, New Orleans, Louisiana
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bin Wang , Xiao-Chun Yang , Guo-Ren Wang , Ge Yu , Lei Chen , X. Sean Wang , Xue-Min Lin, Continually answering constraint k-NN queries in unstructured P2P systems, Journal of Computer Science and Technology, v.23 n.4, p.538-556, July 2008
|
|
|
|
|
|
|
|
|
Eduardo F. Nakamura , Heitor S. Ramos , Leandro A. Villas , Horacio A. B. F. de Oliveira , Andre L. L. de Aquino , Antonio A. F. Loureiro, A reactive role assignment for data routing in event-based wireless sensor networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.53 n.12, p.1980-1996, August, 2009
|
|
|
Hans-Joachim Böckenhauer , Juraj Hromkovi , Richard Královi , Tobias Mömke , Peter Rossmanith, Reoptimization of Steiner trees: Changing the terminal set, Theoretical Computer Science, v.410 n.36, p.3428-3435, August, 2009
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2