skip to content
Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers Preview this item
ClosePreview this item
Checking...

Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers

Author: Bo Chen; Michael S Paterson; Guochuan Zhang
Publisher: Berlin ; New York : Springer, ©2007.
Series: Lecture notes in computer science, 4614.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Edition/Format:   eBook : Document : Conference publication : EnglishView all editions and formats
Database:WorldCat
Summary:

Constitutes the thoroughly refereed post-proceedings of the First International Symposium On Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007, held in Hangzhou,  Read more...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Conference papers and proceedings
Congresses
Additional Physical Format: Print version:
ESCAPE 2007 (2007 : Hangzhou, China).
Combinatorics, algorithms, probabilistic and experimental methodologies.
Berlin ; New York : Springer, ©2007
(DLC) 2007936169
(OCoLC)174167840
Material Type: Conference publication, Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Bo Chen; Michael S Paterson; Guochuan Zhang
ISBN: 9783540744504 3540744509 9783540744498 3540744495
OCLC Number: 184937572
Description: 1 online resource (xii, 530 pages) : illustrations.
Contents: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9 --
Sequential Vector Packing --
A Tighter Analysis of Set Cover Greedy Algorithm for Test Set --
A More Effective Linear Kernelization for Cluster Editing --
CR-precis: A Deterministic Summary Structure for Update Data Streams --
An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning --
On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems --
A Digital Watermarking Scheme Based on Singular Value Decomposition --
A New (t, n)??Threshold Scheme Based on Difference Equations --
Clique-Transversal Sets in Cubic Graphs --
On the L(h, k)-Labeling of Co-comparability Graphs --
An Approximation Algorithm for the General Mixed Packing and Covering Problem --
Extending the Hardness of RNA Secondary Structure Comparison --
On the On-Line Weighted k-Taxi Problem --
Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling --
On the Minimum Risk-Sum Path Problem --
Constrained Cycle Covers in Halin Graphs --
Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost --
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection --
Online Coupon Consumption Problem --
Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization --
Online Capacitated Interval Coloring --
Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service --
Call Control and Routing in SONET Rings --
Fast Matching Method for DNA Sequences --
All-Pairs Ancestor Problems in Weighted Dags --
Streaming Algorithms for Data in Motion --
A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers --
Phrase-Based Statistical Language Modeling from Bilingual Parallel Corpus --
Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory --
On-Line Bin Packing with Arbitrary Release Times --
On the Complexity of the Max-Edge-Coloring Problem with Its Variants --
Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm --
Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance --
Robust Optimization Model for a Class of Uncertain Linear Programs --
An Efficient Algorithm for Solving the Container Loading Problem --
A Bijective Code for k-Trees with Linear Time Encoding and Decoding --
Market-Based Service Selection Framework in Grid Computing --
Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data --
Heuristic Search for 2D NMR Alignment to Support Metabolite Identification --
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array --
Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem --
Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach --
A New Load Balanced Routing Algorithm for Torus Networks --
Optimal Semi-online Scheduling Algorithms on a Small Number of Machines --
Lower Bounds on Edge Searching.
Series Title: Lecture notes in computer science, 4614.; LNCS sublibrary., SL 1,, Theoretical computer science and general issues.
Other Titles: ESCAPE 2007
Responsibility: Bo Chen, Mike Paterson, Guochuan Zhang (eds.).

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/184937572> # Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers
    a schema:CreativeWork, schema:Book, schema:MediaObject ;
    library:oclcnum "184937572" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/930886865#Place/berlin> ; # Berlin
    schema:about <http://experiment.worldcat.org/entity/work/data/930886865#Topic/informatique> ; # Informatique
    schema:about <http://experiment.worldcat.org/entity/work/data/930886865#Topic/algorithms> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/930886865#Topic/mathematics> ; # Mathematics
    schema:about <http://dewey.info/class/511.6/e22/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/930886865#Topic/combinatorial_analysis> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/930886865#Topic/probabilities> ; # Probabilities
    schema:alternateName "ESCAPE 2007" ;
    schema:bookFormat schema:EBook ;
    schema:contributor <http://viaf.org/viaf/7189668> ; # Guochuan Zhang
    schema:contributor <http://viaf.org/viaf/8553621> ; # Bo Chen
    schema:contributor <http://viaf.org/viaf/111114946> ; # Michael S. Paterson
    schema:copyrightYear "2007" ;
    schema:creator <http://experiment.worldcat.org/entity/work/data/930886865#Meeting/escape_2007_2007_hangzhou_china> ; # ESCAPE 2007 (2007 : Hangzhou, China)
    schema:datePublished "2007" ;
    schema:description "The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9 -- Sequential Vector Packing -- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set -- A More Effective Linear Kernelization for Cluster Editing -- CR-precis: A Deterministic Summary Structure for Update Data Streams -- An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning -- On the Complexity and Approximation of the Min-Sum and Min-Max Disjoint Paths Problems -- A Digital Watermarking Scheme Based on Singular Value Decomposition -- A New (t, n)??Threshold Scheme Based on Difference Equations -- Clique-Transversal Sets in Cubic Graphs -- On the L(h, k)-Labeling of Co-comparability Graphs -- An Approximation Algorithm for the General Mixed Packing and Covering Problem -- Extending the Hardness of RNA Secondary Structure Comparison -- On the On-Line Weighted k-Taxi Problem -- Model Futility and Dynamic Boundaries with Application in Banking Default Risk Modeling -- On the Minimum Risk-Sum Path Problem -- Constrained Cycle Covers in Halin Graphs -- Optimal Semi-online Algorithms for Scheduling with Machine Activation Cost -- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection -- Online Coupon Consumption Problem -- Application of Copula and Copula-CVaR in the Multivariate Portfolio Optimization -- Online Capacitated Interval Coloring -- Energy Efficient Heuristic Scheduling Algorithms for Multimedia Service -- Call Control and Routing in SONET Rings -- Fast Matching Method for DNA Sequences -- All-Pairs Ancestor Problems in Weighted Dags -- Streaming Algorithms for Data in Motion -- A Scheduling Problem with One Producer and the Bargaining Counterpart with Two Producers -- Phrase-Based Statistical Language Modeling from Bilingual Parallel Corpus -- Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory -- On-Line Bin Packing with Arbitrary Release Times -- On the Complexity of the Max-Edge-Coloring Problem with Its Variants -- Quantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm -- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance -- Robust Optimization Model for a Class of Uncertain Linear Programs -- An Efficient Algorithm for Solving the Container Loading Problem -- A Bijective Code for k-Trees with Linear Time Encoding and Decoding -- Market-Based Service Selection Framework in Grid Computing -- Informative Gene Selection and Tumor Classification by Null Space LDA for Microarray Data -- Heuristic Search for 2D NMR Alignment to Support Metabolite Identification -- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array -- Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem -- Finding Pure Nash Equilibrium of Graphical Game Via Constraints Satisfaction Approach -- A New Load Balanced Routing Algorithm for Torus Networks -- Optimal Semi-online Scheduling Algorithms on a Small Number of Machines -- Lower Bounds on Edge Searching."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/930886865> ;
    schema:genre "Conference papers and proceedings"@en ;
    schema:genre "Electronic books"@en ;
    schema:genre "Conference publication"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/930886865#Series/lncs_sublibrary> ; # LNCS sublibrary.
    schema:isPartOf <http://worldcat.org/issn/0302-9743> ; # Lecture notes in computer science ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/930886865#Series/lncs_sublibrary_sl_1_theoretical_computer_science_and_general_issues> ; # LNCS sublibrary. SL 1, Theoretical computer science and general issues
    schema:isSimilarTo <http://www.worldcat.org/oclc/174167840> ;
    schema:name "Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers"@en ;
    schema:productID "184937572" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/184937572#PublicationEvent/berlin_new_york_springer_2007> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/930886865#Agent/springer> ; # Springer
    schema:url <http://springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4614> ;
    schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=3063287> ;
    schema:url <http://www.myilibrary.com?id=135362> ;
    schema:url <http://public.eblib.com/choice/publicfullrecord.aspx?p=337268> ;
    schema:url <http://site.ebrary.com/id/10252074> ;
    schema:url <http://www.springerlink.com/openurl.asp?genre=issue&issn=0302-9743&volume=4614> ;
    schema:url <http://rave.ohiolink.edu/ebooks/ebc/9783540744504> ;
    schema:url <http://swbplus.bsz-bw.de/bsz282637095cov.htm> ;
    schema:url <http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-74449-8> ;
    schema:url <http://dx.doi.org/10.1007/978-3-540-74450-4> ;
    schema:workExample <http://worldcat.org/isbn/9783540744498> ;
    schema:workExample <http://worldcat.org/isbn/9783540744504> ;
    schema:workExample <http://dx.doi.org/10.1007/978-3-540-74450-4> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/184937572> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/930886865#Place/hangzhou_china> # Hangzhou, China)
    a schema:Place ;
    schema:name "Hangzhou, China)" ;
    .

<http://experiment.worldcat.org/entity/work/data/930886865#Series/lncs_sublibrary> # LNCS sublibrary.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/184937572> ; # Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers
    schema:name "LNCS sublibrary." ;
    .

<http://experiment.worldcat.org/entity/work/data/930886865#Series/lncs_sublibrary_sl_1_theoretical_computer_science_and_general_issues> # LNCS sublibrary. SL 1, Theoretical computer science and general issues
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/184937572> ; # Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers
    schema:name "LNCS sublibrary. SL 1, Theoretical computer science and general issues" ;
    .

<http://viaf.org/viaf/111114946> # Michael S. Paterson
    a schema:Person ;
    schema:familyName "Paterson" ;
    schema:givenName "Michael S." ;
    schema:name "Michael S. Paterson" ;
    .

<http://viaf.org/viaf/7189668> # Guochuan Zhang
    a schema:Person ;
    schema:familyName "Zhang" ;
    schema:givenName "Guochuan" ;
    schema:name "Guochuan Zhang" ;
    .

<http://viaf.org/viaf/8553621> # Bo Chen
    a schema:Person ;
    schema:familyName "Chen" ;
    schema:givenName "Bo" ;
    schema:name "Bo Chen" ;
    .

<http://worldcat.org/isbn/9783540744498>
    a schema:ProductModel ;
    schema:isbn "3540744495" ;
    schema:isbn "9783540744498" ;
    .

<http://worldcat.org/isbn/9783540744504>
    a schema:ProductModel ;
    schema:isbn "3540744509" ;
    schema:isbn "9783540744504" ;
    .

<http://worldcat.org/issn/0302-9743> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/184937572> ; # Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers
    schema:issn "0302-9743" ;
    schema:name "Lecture notes in computer science ;" ;
    schema:name "Lecture notes in computer science," ;
    .

<http://www.worldcat.org/oclc/174167840>
    a schema:CreativeWork ;
    rdfs:label "Combinatorics, algorithms, probabilistic and experimental methodologies." ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/184937572> ; # Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers
    .

<http://www.worldcat.org/title/-/oclc/184937572>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/184937572> ; # Combinatorics, algorithms, probabilistic and experimental methodologies : first international symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007 : revised selected papers
    schema:dateModified "2016-11-10" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.