Algorithms and Discrete Applied Mathematics 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Cham
Springer Nature
2021
Springer Springer International Publishing AG |
| Edition | 1 |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783030678999 3030678997 3030678989 9783030678982 |
Cover
| Author | Subramanian, C. R. Mudgal, Apurva |
|---|---|
| Author_xml | – sequence: 1 fullname: Mudgal, Apurva – sequence: 2 fullname: Subramanian, C. R. |
| BackLink | https://cir.nii.ac.jp/crid/1130568596572391458$$DView record in CiNii |
| BookMark | eNpdzEtLw0AUBeARH2hr_0MQwYUE5nVv5i5rrQ-ouBG3YTKZtKNpJmbi_zdSV27O4cDHmbGTLnb-iC2oMIorjoUhouN_-4zNhFQoEUCac7ZI6YNzLgvFNcAFu1222ziEcbdPme3q7D4kN_jRZ8u-b4Ovsxc77vzejsGlS3ba2Db5xV_P2fvD-m31lG9eH59Xy01uhUY0uVHOeiWUFY2gYmqrwXpCbryoGgGiBiGRVCOlA6y55pqwIAJX-aqqQc3ZzeG4H-LXt09j6asYP53vxsG25fpuhRqBk57k9UF2IZQu_KYQigMaIIRCKhIazMSuDszZZNuJlfvYxe1g-10qQQvSqNUPJxRbdg |
| ContentType | eBook Book |
| DBID | I4C RYH |
| DEWEY | 004 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue CiNii Complete |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783030678999 3030678997 |
| Edition | 1 |
| Editor | Mudgal, Apurva Subramanian, C. R |
| Editor_xml | – sequence: 1 fullname: Mudgal, Apurva – sequence: 2 fullname: Subramanian, C. R |
| ExternalDocumentID | EBC6465094 BC05264325 5419464 |
| GroupedDBID | AABBV AABLV ABNDO ACNBG ACWLQ AEDXK AEKFX AELOD AIYYB ALMA_UNASSIGNED_HOLDINGS BAHJK BBABE CZZ DBWEY I4C IEZ OCUHQ ORHYB SBO TGIZN TPJZQ TSXQS Z7R Z7X Z83 AEJLV RYH |
| ID | FETCH-LOGICAL-a14668-83cae313a1f19713aa45ae9608e1bf151d512693f22c56d0404967995cbebbd53 |
| ISBN | 9783030678999 3030678997 3030678989 9783030678982 |
| IngestDate | Fri May 30 21:57:12 EDT 2025 Thu Jun 26 22:42:14 EDT 2025 Tue Nov 14 22:53:33 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a14668-83cae313a1f19713aa45ae9608e1bf151d512693f22c56d0404967995cbebbd53 |
| Notes | Includes bibliographical references and index |
| OCLC | 1236265528 |
| PQID | EBC6465094 |
| PageCount | 519 |
| ParticipantIDs | proquest_ebookcentral_EBC6465094 nii_cinii_1130568596572391458 casalini_monographs_5419464 |
| PublicationCentury | 2000 |
| PublicationDate | 2021 c2021 |
| PublicationDateYYYYMMDD | 2021-01-01 |
| PublicationDate_xml | – year: 2021 text: 2021 |
| PublicationDecade | 2020 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationYear | 2021 |
| Publisher | Springer Nature Springer Springer International Publishing AG |
| Publisher_xml | – name: Springer Nature – name: Springer – name: Springer International Publishing AG |
| SSID | ssj0002730455 |
| Score | 2.2032588 |
| SourceID | proquest nii casalini |
| SourceType | Publisher |
| SubjectTerms | Algorithms Algorithms-Congresses Computer algorithms -- Congresses Computer science -- Mathematics -- Congresses Data processing Computer science Discrete applied mathematics |
| Subtitle | 7th International Conference, CALDAM 2021, Rupnagar, India, February 11-13, 2021, Proceedings |
| TableOfContents | Axiomatic Characterization of the Median Function of a Block Graph -- 1 Introduction -- 2 Plurality Strategy and Median Sets in Graphs -- 3 Median Sets in Block Graphs -- 4 Axiomatic Characterization of the Median Function -- 4.1 Independence of the Axioms -- References -- On Coupon Coloring of Cartesian Product of Some Graphs -- 1 Introduction -- 2 Coupon Coloring of Cartesian Product of Graphs -- 3 Coupon Coloring of Bipartite Graphs -- References -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs -- 1 Introduction and Definitions -- 2 Proof of Theorem 2 -- 2.1 Vertices of the Cut Have at Least Two Neighbours in K -- 2.2 Vertices of Degree Two -- 2.3 More Components -- 3 Relation Between Maximal Degree and Diameter of Betweenness-Uniform Graphs -- References -- Combinatorics and Algorithms -- On Algorithms to Find p-ordering -- 1 Introduction -- 2 Preliminaries -- 3 Algorithm to Find p-ordering on a Given Set -- 3.1 Proof of Correctness -- 3.2 Time Complexity -- 4 Algorithm to Find p-ordering on a Set of Representative Roots -- 4.1 Proof of Correctness -- 4.2 Time Complexity -- 5 Structure of Root Sets for a Given k -- References -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- 1 Introduction -- 2 Our Local Search Algorithm -- 3 Finding a Minimum Cost Relabel Operation -- 4 Analysis of MultimayCut for the 3-Way Cut Problem -- 5 Experimental Results -- 5.1 Input Data -- 5.2 Test Cases -- 5.3 Results -- 5.4 Conclusion -- References -- Algorithmic Analysis of Priority-Based Bin Packing -- 1 Introduction -- 2 Statement of Problems -- 3 Motivation -- 4 Feasibility of PBBP-SC -- 4.1 Priority Maximization -- 5 Bin Minimization -- 5.1 Lower Bounds -- 6 Conclusion -- References -- Recursive Methods for Some Problems in Coding and Random Permutations -- 1 Introduction 5.2 Example Construction -- 5.3 NP-Completeness -- 6 More Hardness Results -- 7 Conclusion -- References -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Preliminaries -- 2.1 Problem Definition -- 3 Results: Algorithmic Hardness -- 4 FPT Algorithms -- 5 Structural Results -- 6 Conclusion and Future Direction -- References -- Acyclic Coloring Parameterized by Directed Clique-Width -- 1 Introduction -- 2 Preliminaries -- 2.1 Directed Graphs -- 2.2 Acyclic Coloring of Directed Graphs -- 3 Acyclic Coloring of Directed Co-graphs -- 4 Parameterized Algorithms for Directed Clique-Width -- 5 Conclusions and Outlook -- References -- On Structural Parameterizations of Load Coloring -- 1 Introduction -- 2 Preliminaries -- 2.1 Graph Classes -- 2.2 Clique-Width -- 3 Graphs of Bounded Clique-Width -- 3.1 Upper Bound -- 3.2 Lower Bound -- 4 Parameterized Algorithms -- 4.1 Distance to Cluster Graphs -- 4.2 Distance to Co-cluster Graphs -- 4.3 Distance to Threshold Graphs -- 5 Special Graph Classes -- 6 Conclusion -- References -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- 1 Introduction -- 1.1 Motivation -- 1.2 Related Work -- 1.3 Results -- 2 Preliminaries -- 3 Terrains and Chordal Graphs -- References -- Parameterized Complexity of Locally Minimal Defensive Alliances -- 1 Introduction -- 2 Basic Notations -- 3 Locally Minimal Strong Defensive Alliance on Trees -- 4 FPT Algorithm Parameterized by Neighbourhood Diversity -- 5 Graphs of Bounded Treewidth -- 6 Conclusion -- References -- Computational Geometry -- New Variants of Perfect Non-crossing Matchings -- 1 Introduction -- 1.1 Related Work -- 1.2 Problem Variants Considered and Our Contribution -- 2 Monochromatic Points in General Position -- 2.1 MinMin1 and MaxMax1 Matchings in General Position Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Width Parameters for Hard and Easy Problems -- Matching and Spanning Trees in Geometric Graphs -- Contents -- Approximation Algorithms -- Online Bin Packing with Overload Cost -- 1 Introduction -- 2 Lower Bounds -- 2.1 Proving Theorem 1 -- 2.2 Lower Bounds for Convex Cost Functions -- 3 Upper Bounds: Proving Theorem 2 -- References -- Scheduling Trains with Small Stretch on a Unidirectional Line -- 1 Introduction -- 2 Preliminaries -- 2.1 Network Definition and Problem Statement -- 2.2 The Chain-Hole View -- 3 An O(1)-Approximation of the Optimal Max-Stretch -- 3.1 Schedule for a Single Class Using only Preexisting Holes -- 3.2 The Overall Scheduling Algorithm -- 4 NP-Hardness -- 5 Conclusion -- A Proof of Lemma 2 -- References -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- 1 Introduction -- 2 Bounded Tree-Width Graphs -- 3 Threshold Graphs -- 4 Chain Graphs -- 5 Approximation Algorithm and Complexity -- 5.1 Approximation Bounds -- 5.2 Approximation Algorithm -- 5.3 Approximation Completeness -- References -- Approximation Algorithms for Orthogonal Line Centers -- 1 Introduction -- 2 Preliminaries -- 3 A 2-factor Approximation Algorithm -- 4 A (74, 32) bi-criteria approximation algorithm -- References -- Semitotal Domination on AT-Free Graphs and Circle Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Linear-Time Approximation Algorithm -- 4 Polynomial-Time Exact Algorithm -- 4.1 Construction of G' from G -- 4.2 Algorithm to Find a Minimum Total Dominating Set of G' -- 5 NP-Completeness Result on Circle Graphs -- 6 Conclusion -- References -- Burning Grids and Intervals -- 1 Introduction -- 2 Preliminary Definitions and Symbols -- 3 Related Works -- 4 Burning Grids -- 5 Burning Interval Graphs -- 5.1 Interval Graph Construction 3.1 Notation and Terminology -- References -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- 1 Introduction -- 2 Preliminaries -- 3 Lexicographic Product of Directed Graphs -- 3.1 D1 D2, D1 Is a DDLE Digraph -- 3.2 Cn D2, Cn Is a Dicycle -- 3.3 D1 D2, D1 Is a Symmetric Digraph -- References -- The Connected Domination Number of Grids -- 1 Introduction -- 1.1 Preliminaries and Terminology -- 2 Bounds on the Connected Domination Number -- 2.1 Known Upper Bounds -- 2.2 New Lower Bounds -- 2.3 Gap Between Lower and Upper Bounds -- 3 Conclusions and Further Research -- References -- On Degree Sequences and Eccentricities in Pseudoline Arrangement Graphs -- 1 Introduction -- 1.1 Degree Sequences and Graph Realization Problem -- 1.2 Eccentricities in Pseudoline Arrangement Graphs -- 1.3 A Brief Review on Pseudoline Arrangement Graphs -- 1.4 Tools, Definitions and Notations -- 2 Pseudoline Arrangement Graph Realization Problem -- 2.1 Proof of Necessity of Theorem1 -- 2.2 Constructions and Operations -- 2.3 Proof of Sufficiency of Theorem1 -- 3 Eccentricities in Pseudoline Arrangement Graphs -- 3.1 Basic Results on Eccentricities -- 3.2 Diameter and Characterization of Vertices with Maximum Eccentricity -- 4 Final Remarks -- 4.1 Alternate Proof of d23 in Theorem1 Using Wiring Diagrams -- References -- Cops and Robber on Butterflies and Solid Grids -- 1 Introduction and Results -- 1.1 Organisation -- 2 Definitions -- 3 Butterfly Networks -- 4 Solid Grids -- 5 Conclusion -- References -- b-Coloring of Some Powers of Hypercubes -- 1 Introduction -- 2 Bounds for the b-Chromatic Number of Some Powers of Hypercube -- References -- Chromatic Bounds for the Subclasses of pK2-Free Graphs -- 1 Introduction -- 2 Coloring of Some Classes of 2K2-Free Graphs and pK2-Free Graphs -- References 3 Points in Convex Position -- 3.1 MinMin1 and MaxMax1 Matchings in Convex Position -- 3.2 MinMin2 and MaxMax2 Matchings in Convex Position -- 4 Points on a Circle -- 4.1 MaxMin1 Matching on a Circle -- 4.2 Other Matchings on a Circle -- 5 Doubly Collinear Points -- 5.1 MinMin2 and MaxMax2 Matchings on Doubly Collinear Points -- 5.2 MinMax2 and MaxMin2 Matchings on Doubly Collinear Points -- 6 Conclusions and Future Work -- References -- Cause I'm a Genial Imprecise Point: Outlier Detection for Uncertain Data -- 1 Introduction -- 2 Minimum Diameter -- 3 Smallest Enclosing Circle with Outliers -- 4 Bounding Box -- References -- A Worst-Case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- 1 Introduction -- 2 Preliminaries -- 3 Augmented Face Lattice of Convex Polytopes -- 3.1 Face Lattice of a Convex Polytope -- 3.2 Data Structure for a Face Lattice -- 3.3 Augmenting a Face Lattice -- 3.4 Determination of the Dimension of the Minkowski Sum of Faces -- 4 The Minkowski Sum of Two Convex Polytopes -- 4.1 Necessary and Sufficient Conditions for the Faces of P Q -- 4.2 The Minkowski Sum Algorithm -- 4.3 Minkowski Sum from Other Input Representations -- 4.4 An Example to Prove Worst-Case Optimality -- 5 The Minkowski Sum of Multiple Convex Polytopes -- 6 Concluding Remarks and Acknowledgments -- References -- On the Intersections of Non-homotopic Loops -- 1 Introduction -- 2 Setup and Notation -- 3 General n -- 4 Case n = 2 -- 5 Proof of Proposition1 -- References -- Graph Theory -- On cd-Coloring of Trees and Co-bipartite Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Trees -- 4 Co-bipartite Graphs -- 5 P5-free Graphs -- 6 Double-Split Graphs -- 7 Conclusion -- References -- Cut Vertex Transit Functions of Hypergraphs -- 1 Introduction -- 2 Cut Vertex Transit Functions of Graphs -- 3 Cut Vertex Transit Function of Hypergraphs 2 Locally Recoverable Codes with Partial Locality |
| Title | Algorithms and Discrete Applied Mathematics |
| URI | http://digital.casalini.it/9783030678999 https://cir.nii.ac.jp/crid/1130568596572391458 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=6465094 |
| Volume | 12601 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ1LbxMxEMctGi6ceItQinzg1t0Iv9fc0jRVqRqEUKl6W9nr3TRS2VZ5cOAr8KUZ2_tIAxKCyyZxVj74t2v_ZzwzRuidKbSqMuP8gSY0BXvDpFqXLi2V40YRYirnd3Rnn-TpV352Ja762n8hu2RtR8WPP-aV_A9VaAOuPkv2H8h2nUIDfAe-cAXCcN0Rv93PJrT4Zn4LVv31t1hh-XgBLz-o305TzrpirKtg86v19Y7vr8_0C67S8fnxeHZIYSkOY765q808hl5_rF2Mpz0B63njY-x8dBrzLe3tn7tFcNXzc3MT9__vNsvv3dwP89TS-JIb0e86GR1-GW07HijZcTy0jsd7BikLJkim44FCO5Wsjya-uAxnVOyhPaXAVH44np6dX3Y-MZBSoDCFT8Fp-9GxSFLfr9cPZmV82ijIgXqx-G0RDcrg4gka-GyRp-hBWT9Dj9szMnAzZT5HP3tUGFDhFhVuUOEtVPgDBlD4Hijcg0pwxIT9MCW4hZTggCjBLSAcACXNbVtwXqDLk-nF5DRtDsBIDSxgMkszVpiSEWZIRbSCT8OFKcHozEpiKxBrDvSa1KyitBDSwYTMtfQl_gpbWusEe4kG9W1dvkLYMUYMUcr_wSm12jHOKkveWyoslWaI9ttxzeE1ifXSV7ngRHPJh-gAhjovFv5KiLc7M6GlUJRpwkU2RLiFkIdd_ia0OJ8eTSQPVRpf_6WLffSof8reoMF6uSkPQPCt7dvmOfkF6YJLuA |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Algorithms+and+Discrete+Applied+Mathematics+%3A+7th+International+Conference%2C+CALDAM+2021%2C+Rupnagar%2C+India%2C+February+11-13%2C+2021%2C+Proceedings&rft.au=Mudgal%2C+Apurva&rft.au=Subramanian%2C+C.+R.&rft.date=2021-01-01&rft.pub=Springer&rft.isbn=9783030678982&rft.externalDocID=BC05264325 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783030678999/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783030678999/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9783030678999/sc.gif&client=summon&freeimage=true |