Tools

LEADER 03479cam 2200433 a 4500

001 ocm39347549;

003 OCoLC;

005 20141212131358.0;

008 980619s1998 gw a b 101 0 eng ;

010 a| 98034217;

015 a| GB98-54519;

019 a| 39606074;

020 a| 3540647368 (softcover :alk. paper);

035 a| (Sirsi) o39347549;

035 a| (OCoLC)39347549;

049 a| EREE;

050 00 a| QA76.9.A43b| A65 1998;

082 00 a| 005.12| 21;

245 00 a| Approximation algorithms for combinatorial optimization :b| international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings /c| Klaus Jansen, José Rolim (eds.).;

300 a| viii, 199 pages :b| illustrations ;c| 24 cm.;

336 a| text2| rdacontent;

337 a| unmediated2| rdamedia;

338 a| volume2| rdacarrier;

490 1 a| Lecture notes in computer science ;v| 1444;

500 a| Selected papers from APPROX '98, held July 18-19, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98.;

504 a| Includes bibliographical references and index.;

505 0 a| Approximations of independent sets in graphs / Magnús M. Halldórsson -- Using linear programming in the design and analysis of approximation algorithms : two illustrative problems / David B. Shmoys -- The steiner tree problem and its generalizations / Vijay V. Vazirani -- Approximation schemes for covering and scheduling on related machines / Yossi Azar and Leah Epstein -- One for the price of two : a unified approach for approximating covering problems / Reuven Bar-Yehuda -- Approximation of geometric dispersion problems / Christoph Baur and Sándor P. Fekete --Approximating k-outconnected subgraph problems / Joseph Cheriyan, Tibor Jordán and Zeev Nutov -- Lower bounds for on-line scheduling with precedence constraints on identical machines / Leah Epstein -- Instant recognition of half integrality and 2-approximations / Dorit S. Hochbaum -- The t-vertex cover problem : extending the half integrality framework with budget constraints / Dorit S. Hochbaum -- A new fully polynomial approximation scheme for the knapsack problem / Hans Kellerer and Ulrich Pferschy -- On the hardness of approximating spanners / Guy Kortsarz -- Approximating circular arc colouring and bandwith allocation in all-optical ring networks / Vijay Kumar -- Approximating maximum independent set in k-clique-free graphs / Ingo Schiermeyer -- Approximating an interval scheduling problem / Frits C.R. Spieksma -- Finding dense subgraphs with semidefinite programming / Anand Srivastav and Katja Wolf -- Best possible approximation algorithm for MAX SAT with cardinality constraint / Maxim I. Sviridenko.;

650 0 a| Computer algorithmsv| Congresses.=| ^A417202;

650 0 a| Approximation theoryx| Data processingv| Congresses.=| ^A990125;

650 0 a| Combinatorial optimizationx| Data processingv| Congresses.=| ^A155283;

700 1 a| Jansen, Klaus.=| ^A404491;

700 1 a| Rolim, José D. P.=| ^A373286;

711 2 a| International Workshop on Approximation Algorithms for Combinatorial Optimization Problemsd| (1998 :c| Aalborg, Denmark)?| UNAUTHORIZED;

830 0 a| Lecture notes in computer sciencev| 1444.=| ^A466336;

596 a| 1;

998 a| 648274;

999 a| QA76.9.A43 A65 1998w| LCc| 1i| 30372010241393d| 2/27/2013f| 2/27/2013g| 1l| JGESm| JOYNERr| Ys| Yt| JGESBKu| 4/13/1999x| BOOKz| JSTACKSo| .STAFF. 0;

Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings / Klaus Jansen, José Rolim (eds.).

Other author	Jansen, Klaus.
Other author	Rolim, José D. P.
Other author	International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (1998 : Aalborg, Denmark)
Format	Book
Publication Info	Berlin ; New York : Springer, ©1998.
Description	viii, 199 pages : illustrations ; 24 cm.
Subjects	Computer algorithms--Congresses. Approximation theory--Data processing. --Congresses. Combinatorial optimization--Data processing. --Congresses.

Series	Lecture notes in computer science ; 1444 Lecture notes in computer science 1444. ^A466336
Contents	Approximations of independent sets in graphs / Magnús M. Halldórsson -- Using linear programming in the design and analysis of approximation algorithms : two illustrative problems / David B. Shmoys -- The steiner tree problem and its generalizations / Vijay V. Vazirani -- Approximation schemes for covering and scheduling on related machines / Yossi Azar and Leah Epstein -- One for the price of two : a unified approach for approximating covering problems / Reuven Bar-Yehuda -- Approximation of geometric dispersion problems / Christoph Baur and Sándor P. Fekete --Approximating k-outconnected subgraph problems / Joseph Cheriyan, Tibor Jordán and Zeev Nutov -- Lower bounds for on-line scheduling with precedence constraints on identical machines / Leah Epstein -- Instant recognition of half integrality and 2-approximations / Dorit S. Hochbaum -- The t-vertex cover problem : extending the half integrality framework with budget constraints / Dorit S. Hochbaum -- A new fully polynomial approximation scheme for the knapsack problem / Hans Kellerer and Ulrich Pferschy -- On the hardness of approximating spanners / Guy Kortsarz -- Approximating circular arc colouring and bandwith allocation in all-optical ring networks / Vijay Kumar -- Approximating maximum independent set in k-clique-free graphs / Ingo Schiermeyer -- Approximating an interval scheduling problem / Frits C.R. Spieksma -- Finding dense subgraphs with semidefinite programming / Anand Srivastav and Katja Wolf -- Best possible approximation algorithm for MAX SAT with cardinality constraint / Maxim I. Sviridenko.
General note	Selected papers from APPROX '98, held July 18-19, 1998, University of Aalborg, Denmark, in conjunction with ICALP '98.
Bibliography note	Includes bibliographical references and index.
LCCN	98034217
ISBN	3540647368 (softcover :alk. paper)

Availability

Library	Location	Call Number	Status	Item Actions
Joyner	General Stacks	QA76.9.A43 A65 1998	✔ Available	Place Hold

Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings / Klaus Jansen, José Rolim (eds.).

Click here for more information about this title

Availability