NDLI: Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

Content Provider	Springer Nature Link
Author	Fellows, M. R. Knauer, C. Nishimura, N. Ragde, P. Rosamond, F. Stege, U. Thilikos, D. M. Whitesides, S.
Copyright Year	2007
Abstract	We obtain faster algorithms for problems such as r-dimensional matching and r-set packing when the size k of the solution is considered a parameter. We first establish a general framework for finding and exploiting small problem kernels (of size polynomial in k). This technique lets us combine Alon, Yuster and Zwick’s color-coding technique with dynamic programming to obtain faster fixed-parameter algorithms for these problems. Our algorithms run in time O(n+2 O(k)), an improvement over previous algorithms for some of these problems running in time O(n+k O(k)). The flexibility of our approach allows tuning of algorithms to obtain smaller constants in the exponent.
Starting Page	167
Ending Page	176
Page Count	10
File Format	PDF
ISSN	01784617
Journal	Algorithmica
Volume Number	52
Issue Number	2
e-ISSN	14320541
Language	English
Publisher	Springer-Verlag
Publisher Date	2007-12-07
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Parameterized complexity Fixed parameter tractable Graph matching Set packing Color coding Data Structures, Cryptology and Information Theory Computer Systems Organization and Communication Networks Algorithms Mathematics of Computing Theory of Computation Algorithm Analysis and Problem Complexity
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree

Chordal Editing is Fixed-Parameter Tractable

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs

Parameterized Complexity of Eulerian Deletion Problems

The Parameterized Complexity of Stabbing Rectangles

On Group Feedback Vertex Set Parameterized by the Size of the Cutset

Faster Parameterized Algorithms for Minimum Fill-in

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

Similar Documents

Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree

Chordal Editing is Fixed-Parameter Tractable

Colored Hypergraph Isomorphism is Fixed Parameter Tractable

Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs

Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs

Parameterized Complexity of Eulerian Deletion Problems

The Parameterized Complexity of Stabbing Rectangles

On Group Feedback Vertex Set Parameterized by the Size of the Cutset

Faster Parameterized Algorithms for Minimum Fill-in

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems