On the public citation graph

Chamberlin--Courant Rule with Approval Ballots: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time

0 signed · 84 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-48777-8_2openalex-snapshot
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
inferredcites →https://doi.org/10.1007/978-1-4471-5559-1openalex-snapshot
Fundamentals of Parameterized Complexity
inferredcites →https://doi.org/10.1007/978-1-4615-0897-7_2openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-31204-0_27openalex-snapshot
Multiwinner Voting in Genetic Algorithms for Solving Ill-Posed Global Optimization Problems
inferredcites →https://doi.org/10.1007/978-3-642-02839-7_3openalex-snapshot
Going from Theory to Practice: The Mixed Success of Approval Voting
inferredcites →https://doi.org/10.1007/978-3-642-02839-7_6openalex-snapshot
Approval Balloting for Multi-winner Elections
inferredcites →https://doi.org/10.1007/978-3-642-12683-3_33openalex-snapshot
Algorithms for Detecting Significantly Mutated Pathways in Cancer
inferredcites →https://doi.org/10.1007/978-3-642-33475-7_21openalex-snapshot
Efficient Algorithms for the max k -vertex cover Problem
inferredcites →https://doi.org/10.1007/s00224-007-1309-3openalex-snapshot
Parameterized Complexity of Vertex Cover Variants
inferredcites →https://doi.org/10.1007/s00355-005-0013-yopenalex-snapshot
Going from theory to practice: the mixed success of approval voting
inferredcites →https://doi.org/10.1007/s00355-007-0235-2openalex-snapshot
On the complexity of achieving proportional representation
inferredcites →https://doi.org/10.1007/s00355-016-0983-yopenalex-snapshot
Strategic voting in multi-winner elections with approval balloting: a theory for large electorates
inferredcites →https://doi.org/10.1007/s00355-017-1026-zopenalex-snapshot
Properties of multiwinner voting rules
inferredcites →https://doi.org/10.1007/s10732-018-9376-yopenalex-snapshot
Achieving fully proportional representation by clustering voters
inferredcites →https://doi.org/10.1007/s10878-012-9575-7openalex-snapshot
Efficient algorithms for the max $$k$$ -vertex cover problem
inferredcites →https://doi.org/10.1007/s11238-010-9208-5openalex-snapshot
Making statements and approval voting
inferredcites →https://doi.org/10.1007/springerreference_57547openalex-snapshot
Approximation Algorithms
inferredcites →https://doi.org/10.1016/j.artint.2015.01.003openalex-snapshot
Achieving fully proportional representation: Approximability results
inferredcites →https://doi.org/10.1016/j.artint.2016.09.003openalex-snapshot
Finding a collective set of items: From proportional multirepresentation to group recommendation
inferredcites →https://doi.org/10.1016/j.cosrev.2007.09.001openalex-snapshot
Invitation to fixed-parameter algorithms
inferredcites →https://doi.org/10.1016/j.ipl.2009.05.003openalex-snapshot
Exponential-time approximation of weighted set cover
inferredcites →https://doi.org/10.1016/j.tcs.2014.12.012openalex-snapshot
The complexity of fully proportional representation for single-crossing electorates
inferredcites →https://doi.org/10.1016/j.tcs.2017.10.028openalex-snapshot
Structured proportional representation
inferredcites →https://doi.org/10.1016/s0020-0190(02)00434-9openalex-snapshot
Computing small partial coverings
inferredcites →https://doi.org/10.1016/s0022-0000(03)00073-4openalex-snapshot
The Turing way to parameterized complexity
inferredcites →https://doi.org/10.1051/ita/2016022openalex-snapshot
Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems
inferredcites →https://doi.org/10.1093/acprof:oso/9780198566076.001.0001openalex-snapshot
Invitation to Fixed-Parameter Algorithms
inferredcites →https://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferredcites →https://doi.org/10.1093/comjnl/bxm086openalex-snapshot
Parameterized Complexity of Cardinality Constrained Optimization Problems
inferredcites →https://doi.org/10.1109/tnet.2014.2301816openalex-snapshot
Maximizing Submodular Set Function With Connectivity Constraint: Theory and Application to Networks
inferredcites →https://doi.org/10.1126/science.292.5521.1449openalex-snapshot
The Science of Elections
inferredcites →https://doi.org/10.1137/0209003openalex-snapshot
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
inferredcites →https://doi.org/10.1145/1329125.1329365openalex-snapshot
Some results on approximating the minimax solution in approval voting
inferredcites →https://doi.org/10.1145/3219166.3219170openalex-snapshot
Consistent Approval-Based Multi-Winner Rules
inferredcites →https://doi.org/10.1609/aaai.v24i1.7615openalex-snapshot
Approximation Algorithms and Mechanism Design for Minimax Approval Voting
inferredcites →https://doi.org/10.1609/aaai.v28i1.8891openalex-snapshot
Online (Budgeted) Social Choice
inferredcites →https://doi.org/10.1609/aaai.v29i1.9364openalex-snapshot
Value-Directed Compression of Large-Scale Assignment Problems
inferredcites →https://doi.org/10.1609/aaai.v29i1.9431openalex-snapshot
Finding a Collective Set of Items: From Proportional Multirepresentation to Group Recommendation
inferredcites →https://doi.org/10.2307/1957270openalex-snapshot
Representative Deliberations and Representative Decisions: Proportional Representation and the Borda Rule
inferredcites →https://doi.org/10.2307/2082518openalex-snapshot
Fully Proportional Representation
inferredcites →https://doi.org/10.24963/ijcai.2017/28openalex-snapshot
Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant
inferredcites →https://doi.org/10.24963/ijcai.2017/58openalex-snapshot
Proportional Rankings
inferredcites →https://doi.org/10.48550/arxiv.1309.4405openalex-snapshot
Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
inferredcites →https://doi.org/10.48550/arxiv.1702.08862openalex-snapshot
Proportional Representation in Vote Streams
inferredcites →https://doi.org/10.5555/2936924.2936969openalex-snapshot
Achieving Fully Proportional Representation by Clustering Voters
inferredcites →https://doi.org/10.5555/3091125.3091134openalex-snapshot
Proportional Representation in Vote Streams
inferredcites →https://doi.org/10.5591/978-1-57735-516-8/ijcai11-057openalex-snapshot
Budgeted social choice: from consensus to personalized decision making

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_27openalex-snapshot
Complexity of Manipulative Interference in Participatory Budgeting
inferred← citeshttps://doi.org/10.1007/978-3-031-09016-5openalex-snapshot
Multi-Winner Voting with Approval Preferences
inferred← citeshttps://doi.org/10.1007/978-3-031-09016-5_1openalex-snapshot
Approval-Based Committee Voting
inferred← citeshttps://doi.org/10.1007/978-3-031-09016-5_5openalex-snapshot
Algorithms and Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-55601-2_15openalex-snapshot
Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses
inferred← citeshttps://doi.org/10.1007/s00355-018-1126-4openalex-snapshot
Multiwinner analogues of the plurality rule: axiomatic and algorithmic perspectives
inferred← citeshttps://doi.org/10.1007/s10458-023-09610-zopenalex-snapshot
Parameterized complexity of multiwinner determination: more effort towards fixed-parameter tractability
inferred← citeshttps://doi.org/10.1007/s10472-023-09910-wopenalex-snapshot
Collective combinatorial optimisation as judgment aggregation
inferred← citeshttps://doi.org/10.1007/s10588-026-09444-6openalex-snapshot
Voting for centrality
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103203openalex-snapshot
Preference elicitation and robust winner determination for single- and multi-winner social choice
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100833openalex-snapshot
Techniques in parameterized approximation
inferred← citeshttps://doi.org/10.1016/j.dam.2022.11.018openalex-snapshot
Polynomial-time data reduction for weighted problems beyond additive goal functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.01.017openalex-snapshot
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.115033openalex-snapshot
Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: Greedy strikes back
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115540openalex-snapshot
Max-SAT with cardinality constraint parameterized by the number of clauses
inferred← citeshttps://doi.org/10.1137/1.9781611976465.14openalex-snapshot
FPT-approximation for FPT Problems
inferred← citeshttps://doi.org/10.1137/21m1442267openalex-snapshot
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
inferred← citeshttps://doi.org/10.1145/3296672openalex-snapshot
Committee Scoring Rules
inferred← citeshttps://doi.org/10.1145/3618260.3649771openalex-snapshot
Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
inferred← citeshttps://doi.org/10.1145/3676953openalex-snapshot
The Price of Justified Representation
inferred← citeshttps://doi.org/10.1145/3749377openalex-snapshot
On the Complexity of Destructive Bribery in Approval-Based Multiwinner Voting
inferred← citeshttps://doi.org/10.1145/3749982openalex-snapshot
Parameterized Inapproximability Hypothesis under ETH
inferred← citeshttps://doi.org/10.1145/3763238openalex-snapshot
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage
inferred← citeshttps://doi.org/10.1145/3798129.3800813openalex-snapshot
Oracle Subset Problems: A Meta-algorithm for FPT Approximation via Random Walks
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33012181openalex-snapshot
A Framework for Approval-Based Budgeting Methods
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20429openalex-snapshot
The Price of Justified Representation
inferred← citeshttps://doi.org/10.2139/ssrn.4865146openalex-snapshot
Max-Sat with Cardinality Constraint Parameterized by the Number of Clauses
inferred← citeshttps://doi.org/10.24963/ijcai.2020/39openalex-snapshot
Tight Approximation for Proportional Approval Voting
inferred← citeshttps://doi.org/10.24963/ijcai.2022/69openalex-snapshot
Near-Tight Algorithms for the Chamberlin-Courant and Thiele Voting Rules
inferred← citeshttps://doi.org/10.3390/a13060146openalex-snapshot
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1802.06483openalex-snapshot
Committee Scoring Rules: Axiomatic Characterization and Hierarchy
inferred← citeshttps://doi.org/10.48550/arxiv.1809.04382openalex-snapshot
A Framework for Approval-based Budgeting Methods
inferred← citeshttps://doi.org/10.48550/arxiv.2002.00836openalex-snapshot
On the Complexity of Destructive Bribery in Approval-Based Multi-winner Voting
inferred← citeshttps://doi.org/10.48550/arxiv.2112.00574openalex-snapshot
Collective discrete optimisation as judgment aggregation
inferred← citeshttps://doi.org/10.65109/bwmv7659openalex-snapshot
Complexity of Additive Committee Selection with Outliers
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.