{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:11Z","timestamp":1725559451992},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_12","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:38:24Z","timestamp":1279042704000},"page":"113-125","source":"Crossref","is-referenced-by-count":31,"title":["Inferring AS Relationships: Dead End or Lively Beginning?"],"prefix":"10.1007","author":[{"given":"Xenofontas","family":"Dimitropoulos","sequence":"first","affiliation":[]},{"given":"Dmitri","family":"Krioukov","sequence":"additional","affiliation":[]},{"given":"Bradley","family":"Huffaker","sequence":"additional","affiliation":[]},{"given":"kc","family":"claffy","sequence":"additional","affiliation":[]},{"given":"George","family":"Riley","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Battista, G.D., Patrignani, M., Pizzonia, M.: Computing the types of the relationships between Autonomous Systems. In: IEEE INFOCOM (2003)"},{"key":"12_CR2","unstructured":"Erlebach, T., Hall, A., Schank, T.: Classifying customer-provider relationships in the Internet. In: Proceedings of the IASTED International Conference on Communications and Computer Networks (CCN) (2002)"},{"key":"12_CR3","unstructured":"Gao, L.: On inferring Autonomous System relationships in the Internet. In: IEEE\/ACM Transactions on Networking (2001)"},{"key":"12_CR4","unstructured":"Subramanian, L., Agarwal, S., Rexford, J., Katz, R.H.: Characterizing the Internet hierarchy from multiple vantage points. In: IEEE INFOCOM (2002)"},{"key":"12_CR5","unstructured":"Xia, J., Gao, L.: On the evaluation of AS relationship inferences. In: IEEE GLOBECOM (2004)"},{"key":"12_CR6","unstructured":"Rimondini, M.: Statistics and comparisons about two solutions for computing the types of relationships between Autonomous Systems (2002), \n                    \n                      http:\/\/www.dia.uniroma3.it\/~compunet\/files\/ToR-solutions-comparison.pdf"},{"key":"12_CR7","unstructured":"Siganos, G., Faloutsos, M.: Analyzing BGP policies: Methodology and tool. In: IEEE INFOCOM (2004)"},{"key":"12_CR8","unstructured":"Huber, B., Leinen, S., O\u2019Dell, R., Wattenhofer, R.: Inferring AS relationships beyond counting edges. Technical Report TR\u00a0446, ETH Z\u00fcrich (2004)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear time algorithm for testing the truth of certain quantified boolean formulae. Information Processing Letters\u00a08, 121\u2013123 (1979)","journal-title":"Information Processing Letters"},{"key":"12_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems. In: Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization (2002)","DOI":"10.1007\/3-540-47867-1_6"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997)","DOI":"10.1145\/258533.258536"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.comnet.2003.03.001","volume":"44","author":"H. Chang","year":"2004","unstructured":"Chang, H., Govindan, R., Jamin, S., Shenker, S.J., Willinger, W.: Towards capturing representative AS-level Internet topologies. Computer Networks Journal\u00a044, 737\u2013755 (2004)","journal-title":"Computer Networks Journal"},{"key":"12_CR15","unstructured":"Meyer, D.: University of Oregon Route Views Project (2004)"},{"key":"12_CR16","unstructured":"A traceroute server list (2004), \n                    \n                      http:\/\/www.traceroute.org"},{"key":"12_CR17","unstructured":"Benson, S., Ye, Y., Zhang, X.: A dual-scaling algorithm for semidefinite programming (2004), \n                    \n                      http:\/\/www-unix.mcs.anl.gov\/~benson\/dsdp\/"},{"key":"12_CR18","unstructured":"GmbH, A.S.S.: L E D A library (2004), \n                    \n                      http:\/\/www.algorithmic-solutions.com\/enleda.htm"},{"key":"12_CR19","volume-title":"Multiobjective Optimization: Principles and Case Studies","author":"Y. Collette","year":"2003","unstructured":"Collette, Y., Siarry, P.: Multiobjective Optimization: Principles and Case Studies. Springer, Berlin (2003)"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:00:24Z","timestamp":1558281624000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11427186_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}