Skip to main content

4 Result(s)

within Computer Communication Networks Remove this filter Pallavi Jain Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Hitting and Covering Partially

    d-Hitting Set and d-Set Cover are among the classical NP-hard problems. In this paper, we study variants of d-Hitting Set and d-Set Cover, which are called Partial d -Hitting Set (Partial

    Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain… in Computing and Combinatorics (2018)

  2. No Access

    Chapter and Conference Paper

    Gehrlein Stable Committee with Multi-modal Preferences

    Inspired by Gehrlein stability in multiwinner election, in this paper, we define several notions of stability that are applicable in multiwinner elections with multimodal preferences, a model recently proposed...

    Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy… in Algorithmic Game Theory (2022)

  3. No Access

    Chapter and Conference Paper

    Sparsity in Covering Solutions

    In the classical covering problems, the goal is to find a subset of vertices/edges that “covers” a specific structure of the graph. In this work, we initiate the study of the covering problems where given a gr...

    Pallavi Jain, Manveer Singh Rathore in LATIN 2024: Theoretical Informatics (2024)

  4. No Access

    Chapter and Conference Paper

    Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses

    Max-SAT with cardinality constraint (CC-Max-SAT) is one of the classical NP-complete problems. In this problem, given a CNF-formula $$\varPhi ...

    Pallavi Jain, Lawqueen Kanesh, Fahad Panolan… in LATIN 2024: Theoretical Informatics (2024)