
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
On the approximability of tradeoffs and optimal access of Web sources
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
C.H. Papadimitriou, M. Yannakakis, "On the approximability of tradeoffs and optimal access of Web sources," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 86, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892068, author = {C.H. Papadimitriou and M. Yannakakis}, title = {On the approximability of tradeoffs and optimal access of Web sources}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {86}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892068}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  On the approximability of tradeoffs and optimal access of Web sources SN  02725428 SP EP A1  C.H. Papadimitriou, A1  M. Yannakakis, PY  2000 KW  information resources; optimisation; combinatorial mathematics; computational complexity; information retrieval; Web sources; optimal access; tradeoffs; approximability; multiobjective optimization; combinatorial optimization problem; cost criteria; Pareto curve; polynomially succinct curve; multiple linear objectives; complexity; hyperplane; costtimequality tradeoff; WorldWide Web VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
We study problems in multiobjective optimization, in which solutions to a combinatorial optimization problem are evaluated with respect to several cost criteria, and we are interested in the tradeoff between these objectives (the socalled Pareto curve). We point out that, under very general conditions, there is a polynomially succinct curve that /spl epsiv/approximates the Pareto curve, for any /spl epsiv/<0. We give a necessary and sufficient condition under which this approximate Pareto curve can be constructed in time polynomial in the size of the instance and 1//spl epsiv/. In the case of multiple linear objectives, we distinguish between two cases: when the underlying feasible region is convex, then we show that approximating the multiobjective problem is equivalent to approximating the singleobjective problem. If however the feasible region is discrete, then we point out that the question reduces to an old and recurrent one: how does the complexity of a combinatorial optimization problem change when its feasible region is intersected with a hyperplane with small coefficients; we report some interesting new findings in this domain. Finally, we apply these concepts and techniques to formulate and solve approximately a costtimequality tradeoff for optimizing access to the WorldWide Web, in a model first studied by Etzioni et al. (1996) (which was actually the original motivation for this work).
Index Terms:
information resources; optimisation; combinatorial mathematics; computational complexity; information retrieval; Web sources; optimal access; tradeoffs; approximability; multiobjective optimization; combinatorial optimization problem; cost criteria; Pareto curve; polynomially succinct curve; multiple linear objectives; complexity; hyperplane; costtimequality tradeoff; WorldWide Web
Citation:
C.H. Papadimitriou, M. Yannakakis, "On the approximability of tradeoffs and optimal access of Web sources," focs, pp.86, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.