内容简介
Thisbookconstitutesthejointrefereedproceedingsofthe4thInternationalWorkshoponApproximationAlgorithmsforOptimizationProblems,APPROX2001andofthe5thInternationalWorkshoponRanomizationandApproximationTechniquesinComputerScience,RANDOM2001,heldinBerkeley,California,USAinAugust2001.The26revisedfullpaperspresentedwerecarefullyreviewedandselectedfromatotalof54submissions.Amongtheissuesaddressedaredesignandanalysisofapproximationalgorithms,inapproximabilityresults,on-lineproblems,randomization,de-randomization,average-caseanalysis,approximationclasses,randomizedcomplexitytheory,scheduling,routing,coloring,partitioning,packing,covering,computationalgeometry,networkdesign,andapplicationsinvariousfields.