Inferring AS Relationships: Dead End or Lively Beginning?
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 113-125
- https://doi.org/10.1007/11427186_12
Abstract
No abstract availableKeywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Towards capturing representative AS-level Internet topologiesComputer Networks, 2004
- Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT ProblemsPublished by Springer Nature ,2002
- Complexity and ApproximationPublished by Springer Nature ,1999
- Some optimal inapproximability resultsPublished by Association for Computing Machinery (ACM) ,1997
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979